See how algorithms actually run.
AlgoVault turns sorting, graph, tree, and search algorithms into step-by-step visualizations — with synchronized pseudocode and full playback control.
Four families, one workbench.
- 01
Sorting
Bubble · Quick · Merge · Insertion
Watch comparisons and swaps resolve an unordered array in real time.
- 02
Graph
BFS · DFS · Dijkstra · A*
Trace traversal and shortest-path frontiers as they expand across a network.
- 03
Tree
BST · AVL · Red-Black · Traversals
See insertions, rotations, and rebalancing keep a tree in order.
- 04
Search
Linear · Binary · Hash · Substring
Compare how lookup strategies narrow the search space step by step.
Built to be driven, not watched.
Pick an algorithm
Choose from sorting, graph, tree, and search families — each with adjustable input.
Step or play
Drive the animation frame by frame, or run it through at a speed you control.
Read the code
Synchronized pseudocode highlights the exact line executing at each step.
Ready to dig in?
Open the collection and start stepping through algorithms — nothing to install.
Get started