Skip to main content
Interactive Algorithm Education

Visualize & Master Algorithms & Data Structures

Explore classic & modern sorting algorithms, efficient searching techniques, and interactive data structure visualizations — all with real-time step-by-step animation, comparisons, swaps, and Big-O metrics.

Interactive Studios

Algorithm Visualizers

Choose a category to launch its dedicated interactive studio with step-by-step visualization, Big-O metrics, and pseudocode.

Sorting Visualizer

10 algorithms

Explore 10 sorting algorithms with real-time step-by-step visualization. Compare Bubble, Selection, Insertion, Merge, Quick, Heap, Counting, Radix, Shell, and Timsort.

Array presets: Random · Nearly Sorted · Reversed → Launch Studio

Search Visualizer

6 algorithms

Visualize 6 searching algorithms including Linear, Jump, Exponential, Interpolation, Ternary, and Binary Search with custom target values.

Custom target input · Range visualization → Launch Studio

Data Structures

21 interactive studios

Explore 21 data structures — Linked Lists, Stacks, Queues, Hash Tables, Binary Trees, BSTs, Heaps, Union-Find, Segment Trees, AVL Trees, Red-Black Trees, Tries, B-Trees, Fenwick Trees, Sparse Tables, LCA, Network Flow, A*, and graph representation, traversal, shortest-path, and MST models — with step-by-step operation visualization.

Node-pointer · Tree · Heap visualization → Launch Studio

Graph Algorithms

10 interactive studios

Visualize BFS, DFS, Dijkstra's shortest path, topological sort, Prim's and Kruskal's MST, Bellman-Ford, Kosaraju's SCC, Floyd-Warshall, and Tarjan's articulation points — with animated node traversal, edge relaxation, distance tables, SCC groups, and all-pairs matrices.

SVG graph canvas · Queue/stack snapshots → Launch Studio

Dynamic Programming

5 algorithms

Visualize 0/1 Knapsack, Longest Common Subsequence, Longest Increasing Subsequence, Coin Change, and Edit Distance with animated DP table filling and backtracking.

DP table · Cell highlighting · Path reconstruction → Launch Studio

Greedy Algorithms

3 algorithms

Watch Activity Selection, Fractional Knapsack, and Huffman Coding make locally optimal choices with sorted-candidate visualization and selection vs. rejection tracking.

Sorted candidates · Select/Reject feedback → Launch Studio

Backtracking

2 algorithms

Explore N-Queens and a Sudoku solver with board-grid visualization, recursion-depth tracking, and explicit conflict pruning.

Board grid · Recursion depth · Prune highlighting → Launch Studio
Aa

String Algorithms

4 algorithms

Watch KMP, Rabin-Karp, the Z-Algorithm, and Boyer-Moore find a pattern in a text with LPS/hash/Z-array/bad-character panels and match highlighting.

Aux tables · Rolling hash · Match positions → Launch Studio