A

Admin • 833K Points
Coach

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)

Explanation by: Admin

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

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.