Developer Productivity Tools
Handy interactive tools for understanding complexity, regex patterns, bitwise operations, and more.
Toggle:
Max n:
O(1)Constant
HashMap lookup, array access
O(log n)Logarithmic
Binary search, balanced BST ops
O(n)Linear
Array traversal, linear search
O(n log n)Linearithmic
Merge sort, heap sort, quick sort (avg)
O(n²)Quadratic
Bubble sort, selection sort, nested loops
O(n³)Cubic
Matrix multiplication (naive), Floyd-Warshall
O(2ⁿ)Exponential
Recursive Fibonacci, subsets, brute-force
Growth Comparison Table
| Complexity | n=1 | n=2 | n=4 | n=8 | n=16 | n=32 | n=64 |
|---|---|---|---|---|---|---|---|
| O(1) | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| O(log n) | 0 | 1 | 2 | 3 | 4 | 5 | 6 |
| O(n) | 1 | 2 | 4 | 8 | 16 | 32 | 64 |
| O(n log n) | 0 | 2 | 8 | 24 | 64 | 160 | 384 |
| O(n²) | 1 | 4 | 16 | 64 | 256 | 1024 | 4096 |