Efficiency Analysis of Binary Search and Quadratic Search in Big and Small Data

Kevin Hendy, Wirawan Istiono

Abstract


When doing a searching process, Binary Search is one of the classic algorithm used in sorted data. The characteristic of this algorithm is to make a comparison of the keywords you want to find with the start, middle, and end values of a data series. Keyword search is done by reducing the range of start and end points to finally find the keyword you want to search. The time complexity of the binary search algorithm is O(log2n) while the memory capacity needed is O(1) for iterative implementation and O(log2n) for recursive implementation. This research will develop a level of comparison in binary search in order to get optimal performance in accordance with the amount of data available.

https://doi.org/10.15181/csat.v7i1.2091


References


Mehta, A; Saxena, A; Patel, J.; Thanna, A; Review on comparison of binary search and linear search, International Journal of Engineering Sciences & Management Research, vol. 2, no. 10, pp. 85-89, 2015.

w3schools, Searching Techniques, [Online]. Available: https://www.w3schools.in/data-structures-tutorial/searching-techniques/. [Accessed 15 September 2019].

Balogun, B. G; Sadiku, J. S; Simulating Binary Search Technique Using Different Sorting Algorithms, International Journal of Applied Science and Technology, vol. 3, no. 6, pp. 67-75, 2013.

cssimplified, [Online]. Available: http://cssimplified.com/c-cpp-programming-data-structure/design-an-algorithm-draw-a-corresponding-flow-chart-and-write-a-c-program-for-binary-search-to-search-a-given-number-among-the-list-of-numbers-10m-dec2007. [Accessed 15 September 2019].

Kamlesh Kumar Pandey et al, A Comparison and Selection on Basic Type of Searching Algorithm in Data Structure, International Journal of Computer Science and Mobile Computing, Vol.3 Issue.7, July- 2014, pg. 751-758

Verma, D; Painthankar, D. K; Optimizing the Performance of Quadratic Search using Memorization, International Journal of Advanced Research in Computer Science , vol. 8, no. 3, pp. 481-484, 2017.

Kumar, P.; Quadratic Search: A New and Fast Searching Algorithm (An extension of classical Binary search strategy)," International Journal of Computer Applications, vol. 65, no. 14, pp. 43-46, 2013.

Soulie, J.; C++ Language Tutorial, cplusplus.com, 2007.

Savitch, W.; Absolute C++, Boston: Addison-Wesley, 2002.

Seed, G. M.; An Introduction to Object-Oriented Programming in C++ with Applications in Computer Graphics, Edinburgh: Springer, 2001.

Kusnadi, Adhi.; Perbandingan Algoritma Horspool dan Algoritma Zhu-Takaoka dalam Pencarian String Berbasis Desktop, Ultima Computing vol. 9, no. 1, pp. 12-16, 2017.

Winarno, Michael.; Design and Development of Computer Specification Recommendation System Based on User Budget With Genetic Algorithm, International Journal of New Media Technology, vol. 5, no. 1, pp 25-29, 2018


Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

eISSN: 2029-9966