Re:On the Linear Time Algorithm For Finding Fibonacci Numbers
by vang3lis on Tuesday July 07, 2009 @08:36AM
(#691346)
That and the fact that computing the closed form expression still needs log(n) steps (as exponentiation).
[ Parent
| on HN ]
There are no comments on this comment yet.