01105nas a2200145   4500008004100000245008900041210006900130260001200199300001000211490000700221520063400228100002000862700002100882856005600903       2020                        eng d00aIs the Binary Search Faster when Two Variables are Added in the Middle of the Data?-0 aBinary Search Faster when Two Variables are Added in the Middle   c04/2020  a57-640 v183 a<p>&nbsp;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.</p>
1 aTjendry, Djasen1 aIstiono, Wirawan  uhttp://dline.info/fpaper/jdim/v18i2/jdimv18i2_2.pdf