Analysis and comparison of search algorithms

Haomin Zhao; Dan Xu

doi:10.47297/taposatWSP2633-456928.20250604

PDF
导出
分享
收藏
专辑

Analysis and comparison of search algorithms

6卷第4期

浏览量: 0 Downloads: 0

Analysis and comparison of search algorithms
Analysis and comparison of search algorithms
1.Modern Information Industry Department, Guangzhou College of Commerce, Guangzhou, China
2.Department of Information Technology and Engineering, Guangzhou College of Commerce, Guangzhou, China
2025年6卷第4期页码：158-163
纸质出版日期：2025-04-22
DOI：10.47297/taposatWSP2633-456928.20250604
Accepted：

Scan QR Code

(2025). Analysis and comparison of search algorithms. 科技理论与实践（英文版）, 6(4), 158-163.

Zhao Haomin,Xu Dan.Analysis and comparison of search algorithms[J].Theory and Practice of Science and Technology,2025,06(04):158-163.
(2025). Analysis and comparison of search algorithms. 科技理论与实践（英文版）, 6(4), 158-163. DOI： 10.47297/taposatWSP2633-456928.20250604.

Zhao Haomin,Xu Dan.Analysis and comparison of search algorithms[J].Theory and Practice of Science and Technology,2025,06(04):158-163. DOI： 10.47297/taposatWSP2633-456928.20250604.

摘要

Abstract

This paper deeply studies the sequential search

binary search

hash search

binary search tree

balanced binary search tree (AVL tree and red-black tree)

B tree and B+ tree in the search algorithm

and implements and tests their performance on different data sets using Python programming language. By analyzing the time complexity and space complexity

their advantages and disadvantages in practical applications are evaluated. The experimental results show that for static data sets

binary search and hash search are efficient choices; for dynamic data sets

balanced tree structures such as red-black tree and AVL tree are more suitable. Choosing a suitable algorithm can significantly improve the search efficiency. The research results of this paper provide a theoretical basis and practical guidance for the selection of search algorithms in practical applications.

关键词

Keywords

references

A spatially explicit evolutionary algorithm for the spatial partitioning problem[J]. Yan Y. Liu;; Wendy K. Tam Cho.Applied Soft Computing Journal.2020.

Overview of Big Data Related Analysis [J]. Liang Jiye; Feng Chenjiao; Song Peng Journal of Computer Science, 2016 (01).

Zhen Chao, Di Haitao, Zhao Yimin, etc Research and Implementation of Multi Index Binary Search Method [J]. Electronic Testing, 2020, (07):83-84+97..2020.07.031.

Zhang Hebing Research on the Application Strategy of Binary Search Algorithm [J]. Fujian Computer, 2018, 34 (08): 116-117. DOI: 10.16707/j.cnki. fjpc. 2018.08.056.

SAL-Hashing: A Self-Adaptive Linear Hashing Index for SSDs[J]. Jin Peiquan; Yang Chengcheng; Wang Xiaoliang; Yue Lihua; Zhang Dezhi.IEEE Transactions on Knowledge and Data Engineering.2020.

Research on Large Database Retrieval Based on Improved B+Tree Index [J]. Xiao Hanzhou; Liu Yingchun Journal of Guilin Aerospace Industry College. 2024 (03).

文章被引用时，请邮件提醒。

Submit

No data

Related Author

No data

Related Institution

No data

⁰