From: Leo Talbot (leo at domain maths.tcd.ie)
Date: Thu 28 Oct 1999 - 15:31:37 IST
On Thu, 28 Oct 1999, John P . Looney wrote:
> On Thu, Oct 28, 1999 at 02:57:18PM +0100, Colin Whittaker mentioned:
> > for c:
> >
> > int factorial( int x )
> > {
> > return ( x == 1 ): 1 ? (factorial( x - 1 ) * x);
> > }
>
> Now, feed it 5500, and see what answer it gives. Scheme gives a
> number of approximately 4x10^4090 - try it and see! C barfs at anything
> bigger than 4x10^9!
Well then all you have to do use a huge int datatype, like the MPI in PGP...
Leo
--
I've got green eyes, red hair, and I'm left handed. A hundred
years ago, I'd have been considered in league with the Devil.
http://www.cs.tcd.ie/Leo.Talbot
PGP: RSA 1024 0x341E0EBD fp=79940BEB A9F22827 E524F100 9C83D34A
This archive was generated by hypermail 2.1.6 : Thu 06 Feb 2003 - 13:04:48 GMT