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

There is a version of the subset prob开发者_开发问答lem 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

This is the Partition problem.