Subset sum problem is an example of NP- complete problem.
|Answer» A. true|
|Explanation: subset sum problem takes exponential time when we implement a recursive solution. subset sum problem is known to be a part of np complete problems.|
Login to Continue
It will take less than 2 minutes