# algorithms
This tag is for simulations that make a step-by-step procedure visible — watching the process rather than just seeing the final answer. Sorting Algorithms — Visual & Audio turns comparison and swap operations into animation and sound, Turing Machine and Compiler Pipeline expose how computation itself is built up from simple rules, and Tower of Hanoi — Recursive Solver & 2ⁿ−1 Moves shows a recursive algorithm unwinding move by move. Classic optimization and decision problems appear in 0/1 Knapsack, Stable Matching and Graph Coloring, physics gets an algorithmic speed-up in Barnes–Hut N-body, and data-handling algorithms are represented by LZ77 Compression, CRC Checksum and Reed-Muller Codes. Langton's Ant rounds out the set as a minimal rule-based system whose simple instructions produce surprisingly complex emergent paths.
Found: 12 simulations · 0 articles
🧪 Simulations (12)
Facts about this collection
- 12 algorithm simulations are tagged here, spanning sorting, optimization, computation theory and data encoding.
- Turing Machine and Compiler Pipeline both model the fundamentals of how programs are executed, at different levels of abstraction.
- Barnes–Hut N-body is the one physics simulation in the set, using a tree-based algorithm to speed up gravitational calculations.
- Three simulations — LZ77 Compression, CRC Checksum and Reed-Muller Codes — cover how data is compressed and error-checked.
Simulations in this topic include Sorting Algorithms — Visual & Audio, Langton's Ant, Graph Coloring, Turing Machine, Stable Matching and 0/1 Knapsack.
Looking for more? Dive into the full library of 1000+ interactive, browser-based simulations, or browse every topic.