Binary Search, and Why Sorted Data Is So Powerful
The 'halve it every time' idea. How binary search finds something in a million items in about twenty steps, where it quietly powers databases and even git, and the one condition it needs.
The 'halve it every time' idea. How binary search finds something in a million items in about twenty steps, where it quietly powers databases and even git, and the one condition it needs.
The single most useful data structure I reach for: the hash map. What it is, why lookups are instant, where I use it in real systems, and the catches to know about. No jargon.