Q32
What is the typical space complexity of the Dynamic Programming solution for the Fibonacci sequence using a table?
A.
O(log n)
B.
O(n2)
C.
O(n)
AnswerD.
O(1)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board