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 matches the target value, the search succeeds; otherwise, it continues recursively in either the left or right sub-array depending on whether the target value is less than or greater than the middle element. This process repeats until the target is found or the interval becomes empty.