Peculiarities of performance analysis of search algorithms
Keywords:
algorithm, search, complexity, algorithm efficiency, linear search, binary searchAbstract
The article addresses the analysis of search algorithms and their application in practical tasks. It highlights the theoretical aspects of search operations and the main categories of search algorithm theory. The article examines linear and binary search algorithms and evaluates their complexity. It is proven that the most efficient algorithm is the binary search algorithm.
References
Bhargava A. Grokking Algorithms: An Illustrated Guide for Programmers and Other Curious People. Manning Publications, 2016. 256 p.
Skiena S. S. The Algorithm Design Manual / Springer; 3rd edition (October 6, 2020). 810 p.
Korman T. H. Algorithms. Unlocked. The MIT Press, Massachusetts Institute of Technology, 2013. 207 p.
Stephens R. Essential Algorithms: A Practical Approach to Computer Algorithms Using. John Wiley &Sons, 2013. 624 p.
Sedgewick R., Wayne K. Algorithms. Addison-Wesley Professional, 2020. 956 p.
