[Haskell-cafe] Fibbonachi numbers algorithm work TOO slow.
lennart at augustsson.net
Wed Nov 7 14:47:25 EST 2007
When discussing the complexity of fib don't forget that integer
operations for bignums are no longer constant time.
On Nov 7, 2007 6:55 AM, Henning Thielemann
<lemming at henning-thielemann.de> wrote:
> 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/
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
More information about the Haskell-Cafe