Hegwin.Me

Thoughts grows up by feeding itself with its own words.

The Proof of Stirling's approximation

Stirling公式的证明

Math Algorithm
Mar 09, 2023
When describing the time complexity of an algorithm, we often use Big O notation to describe the growth of computation with the size of the problem. For a factorial $n!$ of positive integers, this time complexity is $O(n)$ if a general recursive implementation is used, which represents a linear increase in computational effort as $n$ grows. When $n$ is large,...