in reply to Re: Re: Factorial algorithm execution time
in thread Factorial algorithm execution time
You need not pass a second parameter to that function - or so it appears. A quick test shows it being broken. I'm not sure I'm following the algorithm either, so I'll leave it at that. (I misunderstood the parameter handling.)
Also summing the logarithms will be fast, but calculating the logarithms in the first place is going to take much longer than straight multiplication would have.
Makeshifts last the longest.
|
|---|