Register

Fibonacci number

454 views
0 votes
0 votes
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 exponential time?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
2
Parshu gate asked Nov 5, 2017
690 views
Fibonacci Series Complexity
PLEASE EXPLAIN HOW TO APPROACH THESE KIND OF PROBLEMS
PLEASE EXPLAIN HOW TO APPROACH THESE KIND OF PROBLEMS
User Avatar
1 votes
1 votes
1 answer
3
Prabhanjan_1 asked Oct 30, 2017
1,768 views
Fibonacci-Sequence
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)$
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)$
User Avatar
3 votes
3 votes
1 answer
4
sumit_kumar asked Jun 25, 2017
3,144 views
find recursive time complexity of fibonacci series by substitution method
what is time comlexity procedure for following recursive equation by substitution method: T(n)= T(n-1)+T(n-2) , if n>=2 =1 , if n=1; =0 , if n=0.
what is time comlexity procedure for following recursive equation by substitution method:T(n)= T(n-1)+T(n-2) , if n>=2 =1 , if n=1; =0 , if n=0.
User Avatar
Link Copied!