Go backward to Asymptotic Classes
Go up to Top
Go forward to Comparison of Algorithms
|
Go backward to Asymptotic Classes Go up to Top Go forward to Comparison of Algorithms |
|
Proposition: For every k in N, c in R, and a in R>0, we have:
1 < n loga(n) < n n < n nloga(n) < n nk< n cn < n n!
