On Sun, Feb 18, 2007 at 06:15:25PM -0500, [EMAIL PROTECTED] wrote: > Now that's an industrial-strength Fibonacci. It's O(log n) not > including the cost of adding and multiplying large Integers, and > uses a bounded amount of memory between calls, making it suitable > for a library. > The slowest part of the test program is actually the bit that prints > the number. So I used this driver program:
I've been here before. http://www.haskell.org/pipermail/haskell-cafe/2005-January/008839.html -- wli _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
