Date: 09/20/05 (Algorithms)    Keywords: no keywords

I ran across this problem in one of my homework assignments for my algorithms class. It has me stumped.

Consider the partition problem: given n positive integers, partition them into two disjoint subsets with the same sum of their elements. (Of course, the problem does not always have a solution.) Design an exhaustive search algorithm for this problem. Try to minimize the number of subsets the algorithm needs to generate.

Source: http://www.livejournal.com/community/algorithms/65129.html