News for hackers. Stuff that matters.

A comment on On the Linear Time Algorithm For Finding Fibonacci Numbers. Parent comment

Re:On the Linear Time Algorithm For Finding Fibonacci Numbers by cperciva on Tuesday July 07, 2009 @10:27AM (#691508)
Yes, and the fastest algorithm I know to evaluate that expression takes O(n log n 2^log*(n)) time.
[ Parent | on HN ]
Re:On the Linear Time Algorithm For Finding Fibonacci Numbers by dangoldin on Tuesday July 07, 2009 @10:54AM (#691565)
Ah my mistake then. I didn't realize the closed form solution takes that long to evaluate.

Couldn't there be a faster way to evaluate it using an algebraic rather than a computational way? I just find the bound you give too high but I may be completely wrong.

[ Parent | on HN ]