All concepts

How to compare algorithms by the way they grow, not by how fast they happen to run on your machine.

A row of numbered lockers in memory. Instant to read by index, costly to change in the middle.

A sequence of characters, like beads on a necklace. In most languages you cannot change one in place.

A chain of nodes. Each one holds a value and the address of the next one.

A pile of plates. The last thing you put on is the first thing you take off.

A line of people. The first one to join is the first one to leave.

Check every value in turn until you find the one you want. The only search that assumes nothing.

Check the middle, discard the half that cannot hold the answer, repeat. A billion values in 30 steps.

A function that solves a problem by calling itself on a smaller version of the same problem.

Make a choice, try to finish, and undo it the moment finishing turns out to be impossible.

One front door for many servers. It spreads requests across them and routes around the ones that fail.

Two processes each holding what the other needs, and neither lets go. Four conditions, and how to break one.

You know the name. The machine needs the address. DNS is what turns one into the other.