Work out time complexity estimator instantly with clear inputs, formula shown and shareable results.
Multiplying the asymptotic operation count by the time per operation gives a rough run-time estimate. The doubling factor shows how badly the algorithm degrades: quadratic work quadruples, cubic work grows eightfold.
Run time estimate
time ≈ operation count ÷ operations per second
n log n ≈ 1.66 million operations, about 0.0166 seconds.
Only to an order of magnitude. Cache behaviour, branch prediction and constant factors easily shift the real time by 10× or more.