Q220
What is the time complexity of the following recursive implementation to find the nth fibonacci number? int fibo(int n) if(n == 1) return 0; else if(n == 2) return 1; return fibo(n - 1) + fibo(n - 2); int main() int n = 5; int ans = fibo(n); printf("%d",ans); return 0;
A.
O(1)
B.
O(2*n)
C.
O(n2)
D.
O(2n)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board