Binary search, step by step

Watch binary search halve the problem

The list is sorted, so each guess at the middle lets us throw away half of what is left. Pick a target, then step through or press play.

Press Step to make the first guess.

Binary search steps: 0   Worst case for 32 items: 6   Linear search would take up to: 32

Doubling the list adds only one extra step, which is what O(log n) means.