Go backward to Asymptotic Classes
Go up to Top
Go forward to Summary

Comparison of Algorithms

Largest problem that can be solved in fixed time.

Execution Steps 1 second 1 minute 1 hour

log₂(n) 2^10⁶ 2^6*10⁷ 2^36*10⁸

n 10⁶ 6*10⁷ 3.6*10⁹

nlog₂(n) 62746 2.8*10⁶ 1.3*10⁸

n² 1000 7746 60000

2ⁿ 23 26 32

n! 9 11 12

Problems that can be solved only by exponential time algorithms are intractable.

Author: Wolfgang Schreiner
Last Modification: December 14, 1999

Execution Steps	1 second	1 minute	1 hour
log₂(`n`)	2^10⁶	2^6*10⁷	2^36*10⁸
`n`	10⁶	6*10⁷	3.6*10⁹
`n`log₂(`n`)	62746	2.8*10⁶	1.3*10⁸
`n`²	1000	7746	60000
2ⁿ	23	26	32
`n`!	9	11	12