(and its logarithm) keep showing up in the analysis of algorithm. Unfortunately, it’s very often unwieldy, and we use approximations of
(or
) to simplify things. Let’s examine a few!
(and its logarithm) keep showing up in the analysis of algorithm. Unfortunately, it’s very often unwieldy, and we use approximations of
(or
) to simplify things. Let’s examine a few!
3 Comments |
algorithms, Mathematics | Tagged: approximation, Factorial, Gosper, Mohanty, Rummens, Stirling |
Permalink
Posted by Steven Pigeon