VisualAlgo offers free, interactive, step-by-step visualizations of classic computer science algorithms: Bubble Sort, Quick Sort, Merge Sort, Heap Sort, Binary Search, Dijkstra, A*, Kruskal, Prim, Bellman-Ford, Floyd-Warshall, Longest Common Subsequence, 0/1 Knapsack, and many more. Please enable JavaScript to run the visualizer.