Is the Binary Search Faster when Two Variables are Added in the Middle of the Data?
Djasen Tjendry, Wirawan Istiono
Journal of Digital Information Management, Vol. 18, No. 2, 2020.
DOI: https://doi.org/10.6025/jdim/2020/18/2/57-64
Link: 
Abstract:
Modern architecture has developed new algorithms for large and distributed data, In this digital era,
algorithms which intended to quickly process, search, and sort data are very much needed by IT developers. This research will discuss the modification of Binary Search Algorithm, which is previously known for its existing low, mid, and high variables. This research will discuss how we can modify the binary search algorithm by adding two variables- the variable mid-low and mid-high. It will show how by adding two variables between the mid variable could improve the performance of the Binary Search Algorithm.