Question: A convenient approximation for computing the factorial n! for large values of n is given by the stirling formula where e is the base for
A convenient approximation for computing the factorial n! for large values of n is given by the stirling formula

where e is the base for natural logarithms or aproximately 2.718282. Write an integer function in C for computing this approximation to a factorial. Assume that the corresponding prototype n_fact(int n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
