Just starting to learn big-oh and asymptotic analysis and I am stuck on this particular proof:
How can we prove 2^n is O(n!)? Thanks
Asked
Active
Viewed 338 times
0
-
Also try http://cs.stackexchange.com/ and maybe a more specific question... (What did you try so far, what are your ideas, etc.) – Michael May 28 '12 at 07:43
-
Isn't this a
question? – Hidde May 28 '12 at 07:52
1 Answers
0
To prove this, all you have show is that there exists some C such that
2n <= C*n!
for all n greater than some n0. This is trivial once you realize that both 2n and n! are products with n terms.
NPE
- 486,780
- 108
- 951
- 1,012