Re: (!?) need fast algorithm for computing factorials

From: Richard Heathfield (dontmail_at_address.co.uk.invalid)
Date: 11/07/03 

Date: Fri, 7 Nov 2003 21:01:25 +0000 (UTC)

Sheldon Simms wrote:

> On Fri, 07 Nov 2003 19:18:38 +0000, Richard Heathfield wrote:
>
>> f10000 < f10000.txt
>>
>> On my rather slow system, it completes in about 0.02 CPU seconds.
>
> This doesn't meet the OP's requirements. He wants to compute
> factorials _up to_ 10000!.
>
> If you would just supply the other 9999 configuration files please...

No need. Just divide that number by 10000, and then by 9999, and then by
9998...and so on! :-)

(BTW You probably noticed that I did actually give the OP a genuine hint
later in my article.) 

-- 
Richard Heathfield : binary@eton.powernet.co.uk
"Usenet is a strange place." - Dennis M Ritchie, 29 July 1999.
C FAQ: http://www.eskimo.com/~scs/C-faq/top.html
K&R answers, C books, etc: http://users.powernet.co.uk/eton