Q24
What is the time complexity of the Dynamic Programming solution for the "0/1 Knapsack Problem" using a table?
A.
O(n log W)
B.
O(W log W)
C.
O(nW)
AnswerD.
O(n2)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board