A

Admin • 833K Points
Coach

Q. Which of the following is true about the time complexity of the recursive solution of set partition problem?

  • (A) it has an exponential time complexity
  • (B) it has a linear time complexity
  • (C) it has a logarithmic time complexity
  • (D) it has a time complexity of o(n2)

Explanation by: Admin

set partition problem has both recursive as well as dynamic programming solution. the recursive solution has an exponential time complexity as it will require to check for all subsets in the worst case.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.