A series, drawn by Nib

Algorithms, drawn

Data structures and algorithms, from binary search upward: every idea drawn, every piece of code runnable a step at a time.

  1. How can 20 guesses find one number in a million?Binary search: one of the simplest ideas in computing, and famously easy to get subtly wrong
  2. What is dynamic programming, really?Work each small question out once: how forty billion steps become ninety-nine