Skip to content

Glossary: Data Structures and Algorithms in JavaScript

Binary search

Also written: binarySearch

Finding an item in a sorted array by checking the middle and discarding the half that can't hold the target. It takes O(log n) steps, at most about 20 for a million items.

Where the book teaches it

Related terms

Lower boundOff-by-one errorLinear search