Algorithm Visualizers

Explore interactive step-by-step animations for classic algorithms and data structures.

Sorting Algorithms

Repeatedly swap adjacent elements until sorted.

Select the smallest remaining element and place it in order.

Build a sorted prefix by inserting each element into place.

Divide, sort subarrays, then merge them back together.

Partition around a pivot, then recursively sort partitions.

Traverse the graph level by level using a queue.

Traverse the graph depth-first using a stack/recursion.

Find shortest paths in weighted graphs with non-negative weights.

Heuristic-guided shortest path search for faster routing.

Grow a minimum spanning tree by adding the cheapest edge.

Build a minimum spanning tree by sorting edges and unioning sets.

Order nodes in a DAG so all edges point forward.