Algorithm running time (Big O)
Approximate running time from the complexity class and operations per second.
Formula
t = f(n) / operations per second
Fields and units
| Input size n | — |
|---|---|
| Complexity | — |
| Operations per second | — |
| Operations | — |
| Time | s |
Worked example
Given: Input size n = 1,000,000; Complexity = O(n log n); Operations per second = 1,000,000,000
Result: Operations = 19,931,568.57; Time = 0.01993 s
How it is calculated
1. Enter the values you know. 2. The calculator converts them to base units and applies the formula. 3. The result is shown in the unit you choose.
Frequently asked questions
How do I calculate it?
Approximate running time from the complexity class and operations per second. Formula: t = f(n) / operations per second. Given: Input size n = 1,000,000; Complexity = O(n log n); Operations per second = 1,000,000,000. Result: Operations = 19,931,568.57; Time = 0.01993 s.
Is the calculator free and private?
Yes. It is free, needs no sign-up and runs in your browser — the numbers you type stay on your device.