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.
Highlights
Summary
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
