University
Sorting
Merge Sort
Split, solve, and merge while watching divide-and-conquer unfold.
Lesson in development
Visual computer science / step by step
See the decision.
Understand the algorithm.
Animated Algorithms turns abstract procedures into guided visual lessons. Explore each state, inspect the data, and connect the animation to real code.
University
Graph
Prim's Algorithm
Grow a minimum spanning tree by choosing the cheapest safe edge.
Open interactive lesson →
University
Graph
Dijkstra's Algorithm
Discover shortest paths from one source through weighted edges.
Open interactive lesson →
University
Graph
A* Search
Guide shortest-path search toward a goal with an informed heuristic.
Open interactive lesson →
University
Parallel
DNS Matrix Multiply
Map communication and reduction across a 3D processor grid.
Open interactive lesson →
University
Parallel
Cannon's Matrix Multiply
Rotate blocks across a 2-D torus mesh with nearest-neighbour shifts only.
Open interactive lesson →
University
Parallel
Parallel Radix Sort
Sort digits or bits with local histograms, prefix scans, and stable scatter.
Open interactive lesson →
University
Graph
Kruskal's Algorithm
Build a minimum spanning forest by comparing globally sorted edges.
Open interactive lesson →