Career Crate
SDE / DSA
GATE Exam
Govt Jobs
Practice
Jobs
Community
Tools
Log in
Sign up
Interactive
Algorithm Visualizer
Step through algorithms — see exactly what happens at each step
Sorting
Bubble Sort
Compare & swap adjacent. O(n²)
Selection Sort
Find min, place at front. O(n²)
Insertion Sort
Insert each element in place. O(n²)
Merge Sort
Divide & conquer. O(n log n) stable
Quick Sort
Pivot + partition. O(n log n) avg
Search
Linear Search
Scan left to right. O(n)
Binary Search
Halve search space. O(log n)
Array
Two Pointers
L+R pointers towards center. O(n)
Sliding Window
Fixed window slides right. O(n)
Data Structures
Stack
LIFO. Push/pop from top. O(1)
Queue
FIFO. Enqueue/dequeue. O(1)
Linked List
Node chain with pointers. O(n) access
Graph
BFS
Level-order traversal. O(V+E)
DFS
Depth-first + backtrack. O(V+E)
Array (space-separated, max 12)
Reset
Bubble Sort
Step 1 / 0
Reset
← Prev
▶ Play
Next →
End
Speed
Normal