Skip to content

Glossary: Data Structures and Algorithms

Binary search

Finding an item in a sorted list by checking the middle and discarding the half that can't hold the target, repeating until found. It takes O(log n) steps, at most 20 for a million order IDs.

Where the book teaches it

Related terms

Off-by-one errorbisectLinear search