January 10th, 2004 01:15 AM Yeah, arbitrary precision is very
confusing. I've tried to make my own like that with huge string
allocations (acturally char arrays) and compare numbers one by
one. I don't know what happened to it, but I probably never
completed it anyways. And that recursive function looks
really....recursive. I don't see any code to exit out of the
loop, IE it will continue to call it self over and over until
the program finally kills the heap/stack or something. I don't
quite know what it is... Also, even if it wasn't a static, it
would still always be zero (if you managed to get an answer out
of it since it loops forever). Why? Since there is no checking
to see if X is less than or equal to 1. Without that it would
multiply it by 0 when x = 0, and thus the answers would be
cleared. Well the only reason I can acturally comment on it is
because I have my C book here with an example of a recursive
function to calculate factorials... heh. Sadly I don't think I'm
*allowed* to post the code up. Sor