Lingua-e
← Glossary

What does "binary search" mean in programming?

binary search is one of the most common terms in software development. This guide explains what it means, how it is used in practice, and why it matters, with real examples from the developer world.

Definition

An algorithm that finds a target value in a sorted array by repeatedly halving the search range. Each step eliminates half the remaining elements, giving O(log n) time complexity. The array must be sorted for binary search to work.

Example

"Binary search on a sorted array of 1 million items takes at most 20 comparisons."

Can you put this sentence in the right order?

Tap the words to place them here

Keep building your technical English

You just looked up what this word means. Lingua-e turns vocabulary like this into full practice: fill-in-the-blanks, listening, and real developer conversations.

Practice this for free

Related terms

Was this page helpful?