Entries
Everything I’ve written up, newest first. If you arrived from a search, the exact error message is usually at the top of the entry.
3 entries
Everything I’ve written up, newest first. If you arrived from a search, the exact error message is usually at the top of the entry.
3 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).
HEY