Re:On the Linear Time Algorithm For Finding Fibonacci Numbers
by jcl on Wednesday July 08, 2009 @04:14PM
(#694581)
So, that actually works by establishing a base value and a derivation step... i.e., it defines N(0), then it expresses N(n) in terms of N(n - 1).
If you try to do the same thing for Fibonacci numbers, you would need to express F(n) in terms of earlier values, not in terms of F(n). What cperciva is jokingly proposing is the equivalent of:
naturals = naturals
which is hardly helpful for computing the values. Lazy languages would not help you there.
If you try to do the same thing for Fibonacci numbers, you would need to express F(n) in terms of earlier values, not in terms of F(n). What cperciva is jokingly proposing is the equivalent of:
which is hardly helpful for computing the values. Lazy languages would not help you there.