Describe the binary search algorithm

Binary Search is an efficient algorithm for finding an item in a sorted array or list. It works by repeatedly dividing the search interval in half and comparing the target value with the middle element of the interval. If the target value is less than the middle element, the search continues in the lower half of the interval; if it's greater, the search continues in the upper half. This process is repeated until the target value is found or the interval is empty.