Algorithm Visualizer

Watch algorithms come alive with step-by-step animations. Select an algorithm to visualize sorting, searching, graph traversal, tree operations, and data structures.

Sortingeasy

Bubble Sort

Repeatedly swap adjacent elements if they are in wrong order

Best: O(n)Avg: O(n²)Worst: O(n²)

Sortingeasy

Selection Sort

Find minimum element and place it at the beginning repeatedly

Best: O(n²)Avg: O(n²)Worst: O(n²)

Sortingeasy

Insertion Sort

Build sorted array by inserting elements one at a time

Best: O(n)Avg: O(n²)Worst: O(n²)

Sortingmedium

Merge Sort

Divide array in half, sort each half, then merge them back

Best: O(n log n)Avg: O(n log n)Worst: O(n log n)

Sortingmedium

Quick Sort

Partition around pivot, recursively sort left and right

Best: O(n log n)Avg: O(n log n)Worst: O(n²)

Sortingmedium

Heap Sort

Build max-heap, repeatedly extract maximum to sort

Best: O(n log n)Avg: O(n log n)Worst: O(n log n)

Searchingeasy

Binary Search

Divide sorted array in half repeatedly to find target

Best: O(1)Avg: O(log n)Worst: O(log n)

Searchingeasy

Linear Search

Check each element sequentially until target is found

Best: O(1)Avg: O(n)Worst: O(n)

Graphmedium

Breadth-First Search

Explore level by level using a queue — finds shortest path

Best: O(V + E)Avg: O(V + E)Worst: O(V + E)

#10

Graphmedium

Depth-First Search

Explore as deep as possible before backtracking — uses stack

Best: O(V + E)Avg: O(V + E)Worst: O(V + E)

#11

Graphhard

Dijkstra's Algorithm

Find shortest path using priority queue — weighted graphs

Best: O(V + E log V)Avg: O(V + E log V)Worst: O(V²)

#12

Data Structureseasy

Stack (Push/Pop)

LIFO data structure — push and pop from the top

Best: O(1)Avg: O(1)Worst: O(1)

#13

Data Structureseasy

Queue (Enqueue/Dequeue)

FIFO data structure — enqueue at rear, dequeue from front

Best: O(1)Avg: O(1)Worst: O(1)

#14

Treesmedium

BST Insert & Search

Insert values maintaining BST property — left smaller, right larger

Best: O(log n)Avg: O(log n)Worst: O(n)

#15

Data Structuresmedium

Hash Table Insert

Map keys to buckets via hash function — O(1) average lookup

Best: O(1)Avg: O(1)Worst: O(n)

Why Visualize Algorithms?

Understanding algorithms through visualization builds deep intuition that reading code alone cannot provide. Seeing how Bubble Sort bubbles elements up, how Quick Sort partitions around a pivot, or how BFS explores level-by-level transforms abstract concepts into concrete understanding.

For interview prep: Algorithm questions are the most common type of technical interview question at companies like Google, Meta, Amazon, and Microsoft. Visualizing how algorithms work helps you explain your approach clearly and catch edge cases.

Features: Step-by-step playback with adjustable speed, 2D and 3D visualization modes, custom input data, highlighted code execution, and complexity analysis for every algorithm.