Exercise 4: 10

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/nsolution.) Design an exhaustive-search algorithm for this problem. Try to minil

number of subsets the algorithm needs to generate.