Q120
What is the time complexity of the recursive implementation used to find the nth fibonacci term?
A.
O(1)
B.
O(n2)
C.
O(n!)
D.
Exponential
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board