All Algorithms — Interactive Visualizer Library

Browse our full library of algorithm visualizations. Each algorithm includes step-by-step animation, code examples in multiple languages, and time & space complexity analysis.

Sorting Algorithms

  • Bubble Sort Visualizer — O(n²) time, O(1) space
  • Selection Sort Visualizer — O(n²) time, O(1) space
  • Insertion Sort Visualizer — O(n²) worst, O(n) best
  • Merge Sort Visualizer — O(n log n), stable sort
  • Quick Sort Visualizer — O(n log n) average
  • Heap Sort Visualizer — O(n log n), in-place
  • Radix Sort Visualizer — O(nk) linear time for integers

Searching Algorithms

  • Linear Search Visualizer — O(n) sequential scan
  • Binary Search Visualizer — O(log n) on sorted arrays

Graph Algorithms

  • Breadth-First Search (BFS) Visualizer
  • Depth-First Search (DFS) Visualizer
  • Dijkstra's Algorithm Visualizer — shortest path
  • Bellman-Ford Algorithm Visualizer — negative weights

Data Structures

  • Stack Visualizer — LIFO operations
  • Queue Visualizer — FIFO operations
  • Linked List Visualizer — dynamic pointers
  • Red-Black Tree Visualizer — self-balancing BST
  • N-Queen Problem Visualizer — backtracking
  • Fibonacci Sequence Visualizer — recursion tree