Binary Search

A highly efficient search algorithm used to find the position of a target value within a sorted array. It repeatedly divides the search interval in half. If the middle element is the target, the search succeeds. Otherwise, if the target is less than the middle element, the search continues in the left sub-array; otherwise, it continues in the right sub-array. This process repeats until the target is found or the interval is empty.