Binary Search, Measured
This video presents the same text shown beside it, spoken and on screen. It adds nothing the text does not say.
State
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.
Show
An atlas index surrenders any name in a dozen looks where a raw list would demand thousands.
Watch for
Sorted and indexed are the two admission tickets.