Interactive algorithm visualisers.
Step through an algorithm one operation at a time, on data you control, with the pseudocode highlighted in time with the picture and a live count of the work done.
Most visualisers play an animation at you. The difference here is control: you can step backwards, scrub to any moment, and run the algorithm on the exact array from your problem set.
Available now
Learning
- AlgoLabSorting and searching, step by step.
- Recursion and the call stackWatch a call stack grow and unwind, and a call tree fill in.
- Empirical complexity plotterMeasured curves against textbook bounds.
- Graph algorithmsTraversal, shortest paths, spanning trees.
- Dynamic programming tablesFill a table cell by cell and read the answer out of it.
- String matchingHow a pattern is found without checking every position.
- Regular expressionsA regex is a state machine; catastrophic backtracking is a path count.
- Bits, floats, text and encodingsWhy 0.1 + 0.2 is not 0.3, shown in the bits rather than asserted.
- Bloom filters and sketchesA Bloom filter’s false-positive rate is a dial, not an accident.
- Automata and Turing machinesA Turing machine is smaller than people expect, which is the entire point.