Visualizer
  • Home
    • Sorting
    • Bubble Sort
    • Quick Sort
    • Merge Sort
    • Insertion Sort
    • Selection Sort
    • Heap Sort
    • Searching
    • Binary Search
    • Linear Search
    • Depth-First Search
    • Breadth-First Search
    • Dynamic Programming
    • Fibonacci Sequence
    • Longest Common Subsequence
    • Knapsack Problem
    • String Matching
    • Naive String Matching
    • Knuth-Morris-Pratt
    • Graph Algorithms
    • Dijkstra's Shortest Path
    • Kruskal's Minimum Spanning Tree
    • Prim's Minimum Spanning Tree
    • Topological Sort
    • Linear Data Structures
    • Array
    • ArrayList
    • Linked List
    • Stack
    • Queue
    • Deque
    • Tree Data Structures
    • Binary Tree
    • Binary Search Tree
    • AVL Tree
    • Red-Black Tree
    • Heap Data Structures
    • Min Heap
    • Max Heap
    • Hash-Based Data Structures
    • Hash Table
    • Map
    • Graph Representations
    • Adjacency Matrix
    • Adjacency List

Algorithm and Data Structure Visualizer

Algorithms

Sorting Algorithms
Bubble SortQuick SortMerge SortInsertion SortSelection SortHeap Sort
Searching Algorithms
Binary SearchLinear SearchDepth-First SearchBreadth-First Search
Dynamic Programming
Fibonacci SequenceLongest Common SubsequenceKnapsack Problem
String Matching
Naive String MatchingKnuth-Morris-Pratt
Graph Algorithms
Dijkstra's Shortest PathKruskal's Minimum Spanning TreePrim's Minimum Spanning TreeTopological Sort

Data Structures

Linear Data Structures
ArrayArrayListLinked ListStackQueueDeque
Tree Data Structures
Binary TreeBinary Search TreeAVL TreeRed-Black Tree
Heap Data Structures
Min HeapMax Heap
Hash-Based Data Structures
Hash TableMap
Graph Representations
Adjacency MatrixAdjacency List