[algogeeks] Partition problem

[pramod]

I came across this problem:
Given N positive integers, partition these 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.