Top Features
CodingQuests is a new algorithm visualization workbench. Open source (MIT).
- Symbolic trace: Watch expressions build as LaTeX, not just values.
- Curryable inspectors: Domain-specific data views, easily configured.
- Bidirectional stepping: Step forward and backward through execution.
About CodingQuests
See algorithms from the inside. Worked examples: FFT, Smith-Waterman, CORDIC.
CodingQuests
The code is on GitHub; for questions or collaboration, contact:
Symbolic Trace
Most debuggers show you values. CodingQuests shows you how those values were computed — as symbolic expressions rendered in LaTeX. Watch twiddle factors build in an FFT. See recurrence relations expand in Smith-Waterman. The same polymorphic interpreter that runs your code captures its symbolic structure.
Curryable Inspectors
Data explorers are curryable: configure them for your domain, compile them into responsive displays. The data explorers build in morphing to show data at different levels of detail. The numerical grid becomes a heatmap as you zoom out. Debugging/development becomes a different kind of activity when you're looking at higher level abstractions.
Bidirectional Stepping
Replay-based execution lets you step backward through code. A timeline scrubs to any earlier state or logged event.