This is the mail archive of the
gcc-help@gcc.gnu.org
mailing list for the GCC project.
Re: simple question [OT]
- From: Eljay Love-Jensen <eljay at adobe dot com>
- To: cowen <cowen at attbi dot com>, gcc-help at gcc dot gnu dot org
- Date: Wed, 27 Nov 2002 12:19:01 -0600
- Subject: Re: simple question [OT]
Hi Charles,
I believe the algorithm, and the results (including 15!) are correct...
given the number of significant digits that the algorithm commits to, which
I think is around 6 significant digits.
The algorithm is an approximation of the mathematical gamma function,
relying on the asymptotic nature of the natural log of the gamma function.
Also, floats and doubles have digits of precision as well, which I assume
is accounted for in the number of significant digits in the lnGamma contract.
Sincerely,
--Eljay