A

Admin • 832.70K Points
Coach

Q. Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

Explanation by: Admin

the recursive solution to subset sum problem takes exponential time complexity whereas the dynamic programming solution takes polynomial time complexity. so dynamic programming solution is faster in terms of time complexity.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.