Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.
|Answer» B. false|
|Explanation: 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.|
Login to Continue
It will take less than 2 minutes