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. Turn every pointer in a linked list round, one wire at a time. Wind a key round a clock of buckets and watch the whole table double. Fold an array into a pyramid and watch a key climb it. Weave six sorts into six cloths and see their work. Type into a sunburst of words and watch it open round every word you could mean.
Seven chapters, all on the wall · the collection is complete · nothing to install
Seven works, all on the wall.
Numbered in learning order. Pointer Chain follows the graph chapter because BFS and DFS lean on its queue and stack. Hash Clock builds its buckets from Pointer Chain’s arrays and lists, Heap Pyramid comes next because Dijkstra’s priority queue is one, and Sorting Loom follows it because heap sort is its pop, again and again. Prefix Sunburst closes the collection with a tree, as it opened, but one that branches on letters instead of comparisons.
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.