Computer Science / Unit 3 CS 0144 short lesson, about 20 seconds
Binary Search, Measured
Captions available
The idea
Binary search runs in O(log N) — but only on a sorted list with access by index, because halving depends on the ordering and jumping on the indexing.
In practice
An atlas index surrenders any name in a dozen looks where a raw list would demand thousands.
Where people slip
Sorted and indexed are the two admission tickets.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Unlocks
Something wrong in this lesson? Flag it · Sources for Computer Science