What Is Binary Search? Explained Simply

What binary search is

Binary search is an efficient algorithm for finding a specific item in a sorted list. Instead of checking each item one by one from the start, binary search repeatedly cuts the search area in half, quickly zeroing in on the target. It is a classic example of a clever algorithm that achieves dramatically better performance than the obvious approach, and it is one of the first efficient algorithms that students of computer science learn.

How it works

Binary search works on a sorted list by looking at the middle item first. If the middle item is what you are looking for, you are done. If your target is smaller, you know it must be in the first half, so you ignore the second half entirely and repeat the process on the first half. If it is larger, you focus on the second half. Each step halves the remaining items to check, rapidly narrowing down to the answer.

The guessing-game analogy

A familiar version of binary search is the number-guessing game. If someone picks a number between 1 and 100 and tells you 'higher' or 'lower' after each guess, the smartest strategy is to guess the middle each time. Guess 50; if told 'higher,' guess 75; and so on. Each guess eliminates half the possibilities, so you can always find the number in at most seven guesses. That is binary search in action, applied to a game.

Why it is so fast

The power of binary search is in that halving. Checking items one by one (a 'linear search') might require looking at every single one, slow for large lists. Binary search, by halving each time, reaches the answer in far fewer steps: for a list of a million items, it needs only about twenty checks instead of up to a million. This efficiency, where the work grows very slowly even as the list grows huge, is what makes binary search so valuable.

The catch: data must be sorted

Binary search has one important requirement: the list must be sorted. The whole method depends on being able to say 'my target is in this half' based on comparing to the middle, which only works if the data is in order. If the list is unsorted, binary search cannot be used directly; you would either need to sort it first or use a different method. This trade-off, sorting enables fast searching, comes up constantly in programming.

Why it matters

Binary search is a cornerstone example of algorithmic thinking: a simple idea, halving the problem, that delivers enormous speed gains. Understanding it shows how the right approach can make a task vastly more efficient, a central theme in computer science. It also appears constantly in real software, from searching sorted data to many other 'divide and conquer' techniques built on the same halving principle.

Related on Skillo

See also: What is an algorithm? Explained simply, What is Big O notation? Explained.

Sources

• Binary search algorithm - Wikipedia

Published date reflects the original event date (2024-08-06). This article is original Skillo editorial written from the sources above; facts were verified in September 2026.