Binary search is an efficient algorithm for finding a target value within a sorted array by repeatedly dividing the search interval in half. It operates in logarithmic time complexity, making it much faster than linear search for large datasets.