On the Linear Time Algorithm For Finding Fibonacci Numbers

You're viewing a comment by Madars and its responses.

Madars Permalink
July 07, 2009, 12:58

Richie: your point about throwing the results away is valid when multiple calls to LinearFibonacci are made. However, it seems that Peteris considers only the performance of single call to LinearFib; by modifying LinearFib according to your suggestion the running time will still be quadratic.

However your point is noted when the application requires multiple Fibonacci numbers - dropping previously computed results is a bit foolish then.

Reply to this comment

Reply To This Comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Comment Help

Type first 3 letters of your name: (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.