python solution to the subset-sum problem. A bruteforce approach

subset-sum

def subsetsum(numbers, target):
   size = 1
   subsets = []
   while size <= len(numbers):
      for combination in combinations(numbers, size):
         if sum(combination) == target:
            subsets.append(combination)
      size += 1
   return subsets


def combinations(numbers, size):
   if len(numbers) <= 0 or size <= 0:
      yield []
   else:
      for index, number in enumerate(numbers):
         for combination in combinations(numbers[index+1:], size-1):
            yield [number]+combination