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
GraphParallel
Parallel Dijkstra
Coordinate workers with local scans, global reductions, and concurrent relaxations.
Open interactive lesson ->
University
Graph
Bellman-Ford Algorithm
Relax directed edges repeatedly and expose reachable negative cycles.
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
SortingParallel
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 ->
University
Graph
Ford-Fulkerson & Edmonds-Karp
Compare DFS and BFS augmenting paths across a classic network and five reductions.
Open interactive lesson ->
University
Data Structures
AVL Tree
Keep binary-search-tree operations logarithmic with height metadata and local rotations.
Open interactive lesson ->
University
Data StructuresGraph
Union-Find
Maintain disjoint sets with path compression and union by rank.
Open interactive lesson ->
University
Data Structures
B-Tree
Zde doplň výstižný popis fungování B-stromu.
Open interactive lesson ->
University
Graph
Boruvka's MST Algorithm
Find a minimum spanning tree by repeatedly merging components through their cheapest outgoing edges.
Open interactive lesson ->
University
Other
Dynamic Programming by Example
Compare Fibonacci, LIS, and 0/1 knapsack side by side while animated DP tables show transitions, winners, and solution reconstruction.
Open interactive lesson ->
University
Other
Hungarian Algorithm
Minimum-cost assignment through row/column reduction, starred zeros, cover adjustments, and alternating-path augmentation.
Open interactive lesson ->