The other half of interview prep. Each algorithm runs step by step as an animation you can play, pause, and scrub, with a plain explanation of every move.
The clearest intro to the visualizer. Step through midpoints, discard a half, and watch the code line highlight with you.
Compare time and space complexities across all algorithms. Click a column header to sort.
| Algorithm⇅ | Time▲ | Space⇅ | |||
|---|---|---|---|---|---|
| Binary Search | Searching | Beginner | O(log n) | O(1) | View → |
| Linear Search | Searching | Beginner | O(n) | O(1) | View → |
| Two Pointers: Pair Sum | Two Pointers | Beginner | O(n) | O(1) | View → |
| Sliding Window: Max Sum | Sliding Window | Intermediate | O(n) | O(1) | View → |
| BFS: Level-Order Traversal | Searching | Intermediate | O(n) | O(n) | View → |
| DFS: Pre-order Traversal | Searching | Intermediate | O(n) | O(h) | View → |
| Merge Sort | Sorting | Intermediate | O(n log n) | O(n) | View → |
| Bubble Sort | Sorting | Beginner | O(n²) | O(1) | View → |
| Selection Sort | Sorting | Beginner | O(n²) | O(1) | View → |
| Insertion Sort | Sorting | Beginner | O(n²) | O(1) | View → |
| Quick Sort | Sorting | Intermediate | O(n log n) avg | O(log n) | View → |
| Stack: Push, Pop, Peek | Stack & Queue | Beginner | O(1) per op | O(n) | View → |
| Queue: Enqueue, Dequeue, Front | Stack & Queue | Beginner | O(1) per op | O(n) | View → |
| BST: Search | Searching | Intermediate | O(h) | O(h) | View → |
| BST: Insert | Searching | Intermediate | O(h) | O(h) | View → |