Binary Search, Measured

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.

An atlas index surrenders any name in a dozen looks where a raw list would demand thousands.