Dynamic algorithm visualization in the browser

Vamonos

Dynamic algorithm visualization in the browser

Algorithm Visualizations

Sorting:

• Insertion sort
• Selection sort
• Mergesort
• Quicksort
• Stoogesort

Recursion:

• Three versions of factorial
• Recursive addition
• Karatsuba’s multiplication algorithm

Dynamic programming:

• Rod-cutting (with quiz)
• Matrix-chain multiplication
• Longest increasing subsequence (simplified)

Graphs:

• Breadth-first search
• Detecting bipartiteness (2-colorability)
• Depth-first search
• Dijkstra’s SSSP algorithm (with quiz)
• Bellman-Ford algorithm
• Prim’s MST algorithm
• Kruskal’s MST algorithm
• Boruvka’s MST algorithm
• Strongly Connected Components
• Ford-Fulkerson Max Flow
• Max Flow Railroad Example
• Ford-Fulkerson Bipartite Matching

All demos use the Vamonos algorithm visualization library (github).