Big O Operations At N
Calculator
O(1) operations
1
Results
- O(1) operations
- 1
- O(log N) operations
- 9.965784
- O(N) operations
- 1,000
- O(N log N) operations
- 9,965.784284
- O(N²) operations
- 1,000,000
Computing results
| O(1) operations | 1 |
| O(log N) operations | 9.965784 |
| O(N) operations | 1,000 |
| O(N log N) operations | 9,965.784284 |
| O(N²) operations | 1,000,000 |
formula-map diagram
- O(1) operations
- 1
- O(log N) operations
- 9.965784
- O(N) operations
- 1,000
- O(N log N) operations
- 9,965.784284
- O(N²) operations
- 1,000,000
Computing relationship
Formula
O(1)=1 ; O(log N)=log₂N ; O(N)=N ; O(N log N)=N·log₂N ; O(N²)=N²= 1
Note
This is a simplified model: it applies the standard computing formula to the numbers you entered and ignores protocol overhead, compression variability, retries, contention and other real-world effects. Size your systems with measured data.