Browse Teach Curate

Binary Search

Binary search finds a key in sorted data by halving the candidate range each comparison, taking O(log n) steps. It only works because the data is sorted — maintaining order is the price paid for logarithmic lookup.

jeremy Video

Binary Search Algorithm in Computer Science

Binary search is a search algorithm that locates a target value within a sorted array by repeatedly halving the search space: it compares the target to the middle element and, based on whether the ta…