An efficient algorithm for finding an item in a sorted list by repeatedly dividing the search interval in half.
Binary search is an efficient algorithm for finding an item in a sorted list by repeatedly dividing the search interval in half. It compares the target value to the middle element and eliminates half of the remaining elements with each comparison. This divide-and-conquer approach makes it much faster than linear search for large datasets.