Back to AlgoViz
Big-O Cheat Sheet
Every sorting, searching, tree, and data structure algorithm on AlgoViz, side by side, with its time and space complexity. Click any row to open its interactive visualizer.
Sorting
| Algorithm | Time Complexity | Space Complexity | Visualize |
|---|---|---|---|
| Bubble Sort | O(n^2) | O(1) | View → |
| Selection Sort | O(n^2) | O(1) | View → |
| Insertion Sort | O(n^2) | O(1) | View → |
| Merge Sort | O(n log n) | O(n) | View → |
| Quick Sort | O(n log n) | O(log n) | View → |
| Heap Sort | O(n log n) | O(1) | View → |
| Counting Sort | O(n + k) | O(k) | View → |
| Radix Sort | O(d * (n+k)) | O(n + k) | View → |
| Bucket Sort | O(n + k) | O(n) | View → |
| Pigeonhole Sort | O(n + N) | O(N) | View → |
| Tim Sort | O(n log n) | O(n) | View → |
| Intro Sort | O(n log n) | O(log n) | View → |
Searching
Tree / Graph
| Algorithm | Time Complexity | Space Complexity | Visualize |
|---|---|---|---|
| Min-Heap | O(log n) Insert/Delete | O(1) | View → |
| In-order Traversal | O(n) | O(h) | View → |
| Pre-order Traversal | O(n) | O(h) | View → |
| Post-order Traversal | O(n) | O(h) | View → |
| Breadth-First Search (BFS) | O(n) | O(w) | View → |
| Best-First Search | O(n log n) | O(n) | View → |
| Binary Search Tree | O(log n) Avg | O(h) Avg | View → |
| AVL Tree | O(log n) | O(log n) | View → |
Data Structures
| Algorithm | Time Complexity | Space Complexity | Visualize |
|---|---|---|---|
| Hashing | O(1) Average | O(n) | View → |
| Stack | O(1) | O(n) | View → |
| Queue | O(1) | O(n) | View → |
| Double-Ended Queue (Deque) | O(1) | O(n) | View → |
| Singly Linked List | O(n) Search | O(n) | View → |
| Doubly Linked List | O(n) Search | O(n) | View → |
| Circular Linked List | O(n) Search/Insert | O(n) | View → |
| Circular Queue | O(1) | O(k) | View → |