Algorithm Visualizer

Currently, we have visualizations for the following data structures and algorithms

• Basics
Stack: Array Implementation
Stack: Linked List Implementation
Queues: Array Implementation
Queues: Linked List Implementation
• Recursion
Factorial
Reversing a String
N-Queens Problem
• Indexing
Binary Search Trees
AVL Trees (Balanced binary search trees)
Red-Black Trees
Splay Trees
• Sorting
Comparison Sorting(AIO)
• Bubble Sort
• Selection Sort
• Insertion Sort
• Shell Sort
• Merge Sort
• Quck Sort
Bucket Sort
Counting Sort
Radix Sort
Heap Sort
• Strings
Boyer-Moore
Knuth-Morris-Pratt
Tries
Compressed Tries
Huffman Coding
• Heap-like Data Structures
Heaps
Binomial Queues
Fibonacci Heaps
Leftist Heaps
Skew Heaps
• Graph Algorithms
Breadth-First Search
Depth-First Search
Connected Components
Dijkstra's Shortest Path
Prim's Minimum Cost Spanning Tree
Topological Sort (Using Indegree array)
Topological Sort (Using DFS)
Floyd-Warshall (all pairs shortest paths)
Kruskal Minimum Cost Spanning Tree Algorithm
• Dynamic Programming
Calculating nth Fibonacci number
Making Change
Longest Common Subsequence
• Others
Disjoint Sets