Data structures, built to be watched.
Each chapter turns one structure into a sculpture you can orbit, step through and rewind. Watch a tree rotate itself level. Lift a graph by one knot and see why Dijkstra is right.
Two chapters on the wall · five in the studio · nothing to install
Seven works. Two on the wall, five in the studio.
Numbered in learning order. Lists, stacks and queues come next because the graph chapter already leans on them, and the heap follows because Dijkstra’s priority queue is one.
Every chapter plays like a film you can hold.
The algorithm runs first and records each step. The sculpture then performs those steps, so you can pause on any of them, go back, or slow the whole thing to a quarter of its speed.
Every step is recorded
The algorithm runs instantly and keeps a snapshot of each step. Play, pause, step, rewind, or slow it to a quarter speed.
It reads along with you
A plain-English caption for every step says what happened and why, down to the comparison that sent a value left or the ticket that moved up the queue.
Poke at anything
Orbit and zoom. Tap a node to see its numbers. Build your own inputs, race two algorithms, and break things on purpose.