Big O Operations At N
Calculator
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.
Example: with the default inputs, calculator.technology.constant_o1 is 1.
More in Technology and computing
See all →Frequently asked questions
What does this Big O calculator compute?+
For an input size N, it evaluates five common growth functions: O(1) = 1, O(log N) = log₂ N, O(N) = N, O(N log N) = N·log₂ N and O(N²) = N².
Is the result the actual running time of my algorithm?+
No. It is a count of abstract operations from the plain formulas, with no constant factors, hardware or implementation details. It shows how the growth functions compare, not how long your code takes.
Which logarithm base is used?+
Base 2. The logarithmic and linearithmic rows use log₂ N.
What is the smallest N I can enter?+
N must be at least 1. At N = 1 the logarithm is 0, so the O(log N) and O(N log N) rows are 0.
Why compare O(N log N) with O(N²)?+
Entering a larger N shows how quickly the quadratic count outgrows the others. The calculator simply puts the five counts side by side for the same N.