Binary search

Binary search is an efficient algorithm for finding a target value within a sorted array or list. It works by repeatedly dividing the search interval in half. If the value of the target is less than the value in the middle of the interval, the search continues in the lower half, or if greater, in the upper half. This process repeats until the target value is found or the search interval is empty.