Subset Sum. Subset Sum is an important and classic problem in computer theory. Given a set of integers and a target number, your goal is to nd a subset of those numbers that sum to the target number. For example, given the set f3; 7; 1; 8;ô€€€3g and the target sum 4, the subset f3; 1g sums to 4. On the other hand,if the target sum were 2, the result is false since there is no subset that sums to 2. The prototype is:
public static boolean canMakeSum(int setOfNums[], int targetSum)