How the core data structures and algorithms actually work under the hood.
2 entries
Each step throws away half the remaining range, which gives the recurrence T(n) = T(n/2) + O(1) and a bound of O(log n).
Hash tables are just arrays plus a hash function: how keys map to slots and why lookups average O(1).