Mcq
Result 501
What is the space complexity of the dynamic programming algorithm for computing the nth Fibonacci number using memoization?
Answer: O(n) Explanation: The dynamic programming algorithm for computing the nth Fibonacci number using memoization has a space complexity of O(n) because it involves storing the solutions to n subproblems in memory.
View Details
/question/mcq/5721