Q. Which of the following is true about the time complexity of the recursive solution of set partition problem?
✅ Correct Answer: (A)
it has an exponential time complexity
Explanation: 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.