How Binary Search Works

Binary search works on an array that's already sorted. It compares the middle value of the search range with the target, then narrows to the second half if the target is larger or the first half if it's smaller. Each round of narrowing cuts the search range in half, so it finds the target in far fewer comparisons than linear search.