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