Computer Algorithms II Lecture Notes

30 September 2008 • Exhaustive Search

---

Stirling’s approximation for large factorials gives a better handle on how fast n! grows:

n! ≈ (n/e)ⁿ√(2πn)

or n! grows rougly in proportion to nⁿ.

---

This page last modified on 24 January 2006.