[Haskell-cafe] Fibonacci numbers generator in Haskell

Ronny Wichers Schreur ronny at cs.ru.nl
Fri Jun 16 03:33:11 EDT 2006

Spencer Janssen writes (in the Haskell Cafe):

> Here's some code I wrote a while back for computing the nth Fibonacci
> number.  It has O(log n) time complexity [..]

The nth Fibonacci number has O(n) digits.


Ronny Wichers Schreur

More information about the Haskell-Cafe mailing list