Question

Sum of subset of array being equal to particular value

Answer 1

Let isSubSetSum(int set[], int n, int sum) be the function to find whether there is a subset of set[] with sum equal to sum. n is the number of elements in set[]. …b) Exclude the last element, recur for n = n-1. If any of the above the above subproblems return true, then return true.