Q. 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)

💬 Discuss

✅ Correct Answer: (D) the dynamic programming solution has a time complexity of o(n log n)

Explanation: recursive solution of subset sum problem is slower than dynamic problem solution in terms of time complexity.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

recursive solution of subset sum problem is slower than dynamic problem solution in terms of time complexity.

💬 Discussion

📊 Question Analytics

👁️

99

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

92%

Success Rate