Algorithms Visualized
Step through animations that bring algorithms to life, and watch them work their magic.
Built for learning in motion
Clean visuals, careful interactions, and export tools—everything you need to explain complex ideas clearly.
A growing library of algorithms
Explore sorting, graph, and pathfinding techniques. Compare steps side‑by‑side and understand how each approach behaves on the same data.
Quicksort
A divide-and-conquer algorithm that picks a pivot and partitions the array around it.
Merge Sort
A stable divide-and-conquer algorithm that divides the array into halves and merges them.
Bubble Sort
A simple sorting algorithm that repeatedly steps through the list and swaps adjacent elements.
Insertion Sort
Builds the final sorted array one item at a time by inserting elements in their correct position.
Quicksort
A divide-and-conquer algorithm that picks a pivot and partitions the array around it.
Merge Sort
A stable divide-and-conquer algorithm that divides the array into halves and merges them.
Bubble Sort
A simple sorting algorithm that repeatedly steps through the list and swaps adjacent elements.
Insertion Sort
Builds the final sorted array one item at a time by inserting elements in their correct position.
Selection Sort
Finds the minimum element and places it at the beginning of the array.
Dijkstra's Algorithm
Finds the shortest path between nodes in a weighted graph.
Breadth-First Search
Explores all nodes at the present depth before moving to nodes at the next depth level.
Depth-First Search
Explores as far as possible along each branch before backtracking.
A* Search
An informed search algorithm that finds the shortest path using heuristics.
Heap Sort
Uses a binary heap data structure to sort elements efficiently.
Kruskal's Algorithm
Finds the minimum spanning tree of a weighted undirected graph.
Prim's Algorithm
Greedy algorithm to compute a minimum spanning tree by growing from a starting node.
Ready to see algorithms come alive?
Jump into the playground and run your first visualization in seconds.