About
A better way to understand algorithms — visually, step by step.
What is this?
Algorithm Visualizer is an interactive tool that brings algorithms to life. Instead of reading pseudocode or tracing through dry runs, you can watch algorithms execute in real time — see how a pathfinding algorithm explores a maze, how sorting algorithms compare and swap elements, or how backtracking systematically places queens on a chessboard. The goal is to make the learning process more engaging and intuitive.
Algorithms (30+)
Graph Search
- ●DFS
- ●BFS
- ●Dijkstra
- ●A*
- ●Recursive Maze Generation
Data Structures
- ●Linked List — insert, delete, search, reverse (singly & doubly)
Trees
- ●Binary Search Tree — insert, delete, search with animated re-layout
Interactive Graphs
- ●Graph Traversal — BFS / DFS
- ●Shortest Path — Dijkstra & Bellman-Ford (with negative-cycle detection)
- ●Minimum Spanning Tree — Kruskal & Prim
- ●Connectivity — Connected Components, Strongly & Weakly Connected
- ●Network Flow — max flow / min cut (Edmonds-Karp & Ford-Fulkerson)
Sorting
- ●Bubble Sort
- ●Selection Sort
- ●Insertion Sort
- ●Heap Sort
- ●Merge Sort
- ●Quick Sort
Number Theory
- ●Sieve of Eratosthenes
- ●Ulam Spiral
Backtracking
- ●N-Queen
Geometry
- ●Graham Scan (Convex Hull)
Search
- ●Binary Search
Recursion
- ●Fibonacci
- ●Binomial Coefficient
- ●Derangement
- ●Fast Exponentiation
- ●Stirling Number (2nd Kind)
Automata
- ●Turing Machine — Bitwise NOT, Increment, 2's Complement
Simulation
- ●Conway's Game of Life
Tech Stack
Next.jsReactTailwind CSSRadix UILucide Icons