Tjendry, Djasen and Istiono, Wirawan (2020) Is the Binary Search Faster when Two Variables are Added in the Middle of the Data? Journal of Digital Information Management, 8 (2).
Full text not available from this repository.Abstract
Modern architecture has developed new al- gorithms 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 Al- gorithm.
| Item Type: | Article |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 006 Special Computer Methods |
| Divisions: | Faculty of Engineering & Informatics > Informatics |
| Depositing User: | Administrator UMN Library |
| Date Deposited: | 15 Oct 2021 03:54 |
| Last Modified: | 15 Oct 2021 03:54 |
| URI: | https://kc.umn.ac.id/id/eprint/18803 |
Actions (login required)
 |
View Item |
