RE: Really big numbers

["David Morris" <dmorris@xxxxxxxxxxxxx>]

Java & Rexx fans,

In testing it appears that both run at a similar speed and with the same 
precision.  I know 
how to do I/O in Java so at this point Java gets the nod.  Also Java does not 
have a 
problem with recurssion where rexx is limited to 100 levels, which makes for an 
uglier 
solution.  Also, I am not sure how to dynamically set the scale in Rexx.

Here is the Java solution:

public static BigDecimal factorial(int n) {
        if (n == 1)
        {
                return new BigDecimal(1);
        }
        else
        {
                BigDecimal bd1 = new BigDecimal(n);
                BigDecimal bd2 = bd1.multiply(factorial(n - 1));
                
                return bd2;
        }
}

The Rexx looks like:

numeric digits 1500
arg x
y = 1

do i = x to 1 by -1
  y = i * y
end

say y
exit

Thanks for your help and suggestions.

David Morris

+---
| This is the RPG/400 Mailing List!
| To submit a new message, send your mail to RPG400-L@midrange.com.
| To subscribe to this list send email to RPG400-L-SUB@midrange.com.
| To unsubscribe from this list send email to RPG400-L-UNSUB@midrange.com.
| Questions should be directed to the list owner/operator: david@midrange.com
+---