In the context of teaching algorithms to first-year students, I needed a tool for visualizing arbitrary pseudocode, so students could see exactly what happens in the algorithms seen in class.
AlgoLab does that for classic algorithms and standard data structures, step by step. Algorithms are written in a small purpose-built DSL with first-class support for arrays, iterators, pointers, and function calls. A constraint-based static type inference engine statically determines iterators and their target array, driving the visualization without runtime heuristics.
The runtime breaks each execution into discrete steps that the user can walk forward and backward through, with breakpoints, step-over, and step-out. It ships with the common algorithms, though its strength comes from the ability to write and visualize your own custom code.
