About AlgoVis

A step-by-step algorithm visualizer built to make abstract computer science concepts tangible.

What is this?

AlgoVis lets you step through algorithms at your own pace — forward, backward, and at any speed. Every visualization shows not just the final result, but the decision made at each individual step. Whether you are a student learning algorithms for the first time or refreshing your knowledge before an interview, the goal is to make the logic visible.

Algorithms covered

Graphs & Trees5 algorithms
Bellman-FordFord-FulkersonDijkstra's AlgorithmBreadth-First SearchDepth-First Search
Sorting5 algorithms
Merge SortQuick SortBubble SortInsertion SortBucket Sort
Searching & Arrays2 algorithms
Binary SearchLinear Search
Dynamic Programming3 algorithms
0/1 KnapsackLongest Common SubsequenceMaximum Subarray
Divide & Conquer4 algorithms
Tower of HanoiClosest Pair of PointsMaximum Subarray (D&C)Median of Two Sorted Arrays
Greedy Algorithms3 algorithms
Dijkstra's AlgorithmInterval SchedulingHuffman Coding

Built with

Next.js 16App Router
React 19UI
TypeScriptType safety
Tailwind CSS v4Styling
SVGVisualizations

How it works

Each algorithm is implemented as a JavaScript generator function that yields a snapshot of its state at every meaningful step. The page collects all snapshots up front, then the playback controller indexes into that array. This means scrubbing backward is free — no undo logic required.