How to get some subset from a set? (Algorithm needs...)

Question

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

Duplicate 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

score 1 · Accepted Answer · answered Apr 26 '11 at 12:47

1

This is the Partition problem.

answered Apr 26 '11 at 12:47

Aasmund Eldhuset

37,289
4
68
81

How to get some subset from a set? (Algorithm needs...)

1 Answers1