Watch the code run.
Every topic is real code you can step through line by line, with a visualization that moves in lockstep. Scrub it, slow it down, feed it your own input — until the algorithm stops being memorized and starts being obvious.
step through sorting →Topics
SortingBubble, insertion, selection, merge, quick — watch elements slide into place.5 algorithmsSearchingLinear, binary, lower bound — and the invariants that make binary search hard to get right.3 algorithmsLinked listsPointer surgery, slow/fast runners, cycle detection.soon
Stacks & queuesNext greater, sliding window max, largest rectangle — the monotonic pattern.3 algorithmsTreesTraversals, BST operations, balancing — drawn as they recurse.soon
GraphsBFS, DFS, Dijkstra — the frontier, animated.soon
Dynamic programmingWatch the table fill and the subproblems collapse.soon