Q. Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.
✅ Correct Answer: (B)
false
Explanation: the recursive solution to set partition 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.