Post Reply 
Fibonacci sequence by recursive algorithm fail
04-25-2015, 06:12 AM
Post: #20
RE: Fibonacci sequence by recursive algorithm fail
No, because running non recursive evaluator is not a runtime error, your program will still run (it will run slower).
You can't expect a recursive Fibonacci program to finish with n=100 (unless you have some remember table), because the time required is proportionnal to Fibonacci(100) that's about 1e20.
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
RE: Fibonacci sequence by recursive algorithm fail - parisse - 04-25-2015 06:12 AM



User(s) browsing this thread: