Create an Interactive Algorithm Visualization Forge that converts algorithm implementations or pseudocode into step-by-step visual demonstrations. Support sorting, graph traversal, shortest paths, recursion, dynamic programming, searching, and common data structures. Let learners control execution speed, pause at individual operations, inspect variables, watch data structures change, and compare different algorithms on identical inputs. Include complexity explanations, editable test cases, edge-case challenges, and code synchronized with each visual step. Detect unsupported language constructs rather than guessing how they execute. Clearly distinguish measured runtime from theoretical complexity, and ensure each visualization follows the actual algorithm rather than an illustrative animation that merely looks correct.
0 Comments