​KembaraXtra-Computer Terms – binary search:
Binary search is an efficient search algorithm used to locate a specific item within a sorted or ordered list. The process begins by comparing the desired item with the element located at the center of the list. If the middle element matches the target, the search is complete. If not, the list is divided into two halves, and the algorithm determines which half could contain the target value based on the ordering of the list.
The process continues by repeatedly narrowing the search to the appropriate half of the remaining list until the item is found or the search space becomes empty. Because it eliminates half of the remaining items with each step, binary search is much faster than simple sequential searching for large ordered datasets.