Skip to content

Comment on On calculating Fibonacci numbers in Cparent

Comments

Just a note, In the iterative solution, by changing the i (loop variable) from an int to an long int the times by both iterative and recursive are almost equal. Here are the new results

[Recursive - 7921 ms], [Iteratiive - 8078 ms]

So the difference is negligible.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.