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 reply to Re: Re: Re: Re: Factorial algorithm execution time
by Anonymous Monk
in thread Factorial algorithm execution time
by gri6507
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |