Algorithms

Patterns and proofs.

Binary search beyond sorted arrays

Searching the answer space when a monotonic predicate is all you have.
Dynamic programming as a state machine

State, transition, base case — and the choice between top-down and bottom-up.
Union-Find · the near-O(1) set merger

Path compression and union by rank, and why the amortized cost is almost constant.

Press Esc or click anywhere to close