Q7
What is the time complexity of the naive recursive solution for the Fibonacci sequence?
A.
O(log n)
B.
O(n2)
C.
O(n)
D.
O(2n)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board