Binary search

Finding an item in a sorted list by looking at the middle of what is left and throwing away the half it can't be in - about twenty looks for a million items.

Depth 1 · Foundation

You can carry out and write binary search with low, high and middle, explain why it needs a sorted list and takes about log₂ n looks, avoid its off-by-one traps, and use the bisect module.

Depths of understanding

1
Foundation
You can carry out and write binary search with low, high and middle, explain why it needs a sorted list and takes about log₂ n looks, avoid its off-by-one traps, and use the bisect module.
Opens after
Algorithm efficiencyBinary search matters because of how slowly its work grows, so you need to compare growth first.

Your path here

What's still between you and Binary search, depth 1, in the order you can learn it.

Where it fits

Builds on

Algorithm efficiency

This concept

Binary searchAlgorithms

Builds onThis conceptAlgorithm efficiency Binary searchAlgorithms