|
|
|
| No such thing as a small change | |
| PerlMonks |
Re: Re: Re: Re: Factorial algorithm execution timeby Anonymous Monk |
| on Oct 27, 2002 at 16:15 UTC ( [id://208353]=note: print w/replies, xml ) | Need Help?? |
|
I didn't say it was preferable. I tried to explain how you can derive one of these approximations. As for robustness, all of the solutions presented in this discussion use big integer arithmetic. Until you run out of memory, they are precise to the last digit.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||