Question

As per image give answer

Answer 1

Answer:

check if the partial sum is equals to target

if s == target:

print "sum(%s)=%s" % (partial, target)

if s >= target:

return # if we reach the number why bother to continue

for i in range(len(numbers)):

n = numbers[i]

remaining = numbers[i+1:]

subset_sum(remaining, target, partial + [n])

if __name__ == "__main__":

subset_sum([3,9,8,4,5,7,10],15)

#Outputs:

#sum([3, 8, 4])=15

#sum([3, 5, 7])=15

#sum([8, 7])=15

#sum([5, 10])=15

This type of algorithms are very well explained in the following Stanford's Abstract Programming lecture - this video is very recommendable to understand how recursion works to generate permutations of solutions.