Q977
What is the worst case time complexity of dynamic programming solution of the subset sum problem(sum=given subset sum)?
A.
O(n)
B.
O(sum)
C.
O(n2)
D.
O(sum*n)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board