What would be the example of a function f(n) that is asymptotically slower than O(n^n) and faster than O(n!), i.e.
O(n!) < O(f(n))< O(n^n)
?
Asked
Active
Viewed 184 times
1 Answers
0
f: n ↦ (n+1)! is one such function.
Oswald
- 31,254
- 3
- 43
- 68
-
where does it go up to-- until which value of k in (n+k)! ? – Roam Jan 30 '14 at 09:10
-
Actually, I am not sure anymore. Obviously, O(n!) < O((n+1)!), but I do not know how to prove O((n+1)!) < O(nⁿ). – Oswald Jan 30 '14 at 09:34