This is the partition problem[1]. So to answer your question: the problem is NP-complete, but there are pseudo-polynomial time dynamic programming solutions (se

This is the partition problem[1]. So to answer your question: the problem is NP-complete, but there are pseudo-polynomial time dynamic programming solutions (see the wikipedia entry for details). [1]: http://en.wikipedia.org/wiki/Partition_problem http://en.wikipedia.org/wiki/Partition_problem