There is a version of the subset problem that asks if it is possible to find a subset of a set of integers that add up to the sum of the numbers not in the subset. Anyone know what the algorithm is? Thanks
Asked
Active
Viewed 385 times
1
-
1Duplicate http://stackoverflow.com/questions/443712/algorithm-to-find-subset-within-two-sets-of-integers-whose-sums-match. – Captain Giraffe Apr 26 '11 at 12:47
