You're replying to a comment by Hadi Moshayedi.

July 07, 2009, 14:37

To David: It's not a naive O(N^2) algorithm, it's actually O(Fib(n)) (assuming constant time addition).

To Peteris: Nice analysis :) It was well worth every byte :)

Reply To This Comment

(why do I need your e-mail?)

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

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

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