Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
aeon10
on Jan 29, 2013
|
parent
|
context
|
favorite
| on:
On calculating Fibonacci numbers in C
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.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
[Recursive - 7921 ms], [Iteratiive - 8078 ms]
So the difference is negligible.