Which of the following is not true about subset sum problem?

Question

TuteeHUB · Accepted Answer

NA

TuteeHUB · Answer

the recursive solution has a time complexity of O(2n)

TuteeHUB · Answer

there is no known solution that takes polynomial time

TuteeHUB · Answer

the recursive solution is slower than dynamic programming solution

TuteeHUB · Answer

the dynamic programming solution has a time complexity of O(n log n)

1.	Which of the following is not true about subset sum problem?
A.	the recursive solution has a time complexity of O(2n)
B.	there is no known solution that takes polynomial time
C.	the recursive solution is slower than dynamic programming solution
D.	the dynamic programming solution has a time complexity of O(n log n)
Answer» E.

Discussion