An efficient searching algorithm repeatedly dividing sorted search space in half until finding target or determining absence. Binary search requires sorted data but achieves O(log n) time complexity. Divide-and-conquer approach compares middle elements against targets. Binary search is fundamental to efficient searching in large datasets.