434 views
0 votes
0 votes
How fibonacci timecomplexity on dynamic approach and recursive approach is different

Couldnt understand the algo properly

If someone could help :)

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
srestha asked Jun 15, 2018
450 views
How "a fibonacci algorithm runs in polynomial time in n but the optimal running time is exponential in n."?Is it possible to running same algorithm in both polynomial and...
0 votes
0 votes
2 answers
3
1 votes
1 votes
1 answer
4
Prabhanjan_1 asked Oct 30, 2017
1,722 views
Which of the following is true about time complexity for generating $\color{blue} {n^{th}}$ Fibonacci number ? a)$O(n)$b)$O(Logn)$c)$O(2^n)$d)$\Omega(n)$