[Haskell-cafe] Fibbonachi numbers algorithm work TOO slow.

Henning Thielemann lemming at henning-thielemann.de
Wed Nov 7 08:55:08 EST 2007

On Tue, 6 Nov 2007 ajb at spamcop.net wrote:

> However, this is still an O(log n) algorithm, because that's the
> complexity of raising-to-the-power-of.  And it's slower than the
> simpler integer-only algorithms.

You mean computing the matrix power of

/1 1\
\0 1/


More information about the Haskell-Cafe mailing list