You are viewing a single comment's thread. Return to all comments →
Problem with fibonacci(n-1) + fibonacci(n-2) is that it takes huge amount of time to calculate . With complexity of O(2^n) , for large values of 'n' .
Seems like cookies are disabled on this browser, please enable them to open this website
Recursion: Fibonacci Numbers
You are viewing a single comment's thread. Return to all comments →
Problem with fibonacci(n-1) + fibonacci(n-2) is that it takes huge amount of time to calculate . With complexity of O(2^n) , for large values of 'n' .