See how different algorithm complexities scale as input size grows. Drag the slider to watch curves diverge dramatically.
| Complexity | Name | Example | Ops at n=100 |
|---|---|---|---|
| O(1) | Constant | dict lookup | 1.0 |
| O(log n) | Logarithmic | binary search | 6.6 |
| O(n) | Linear | linear search | 100 |
| O(n log n) | Linearithmic | merge sort | 664 |
| O(n²) | Quadratic | bubble sort | 10.0K |