subset_sum, a Python code which seeks solutions of the subset sum problem, in which it is desired to find a subset of integers which has a given sum.
subset_sum_table() works by a kind of dynamic programming approach, constructing a table of all possible sums from 1 to S. The storage required is N * S, so for large S this can be an issue.
SUBSET_SUM_FIND works by brute force, trying every possible subset to see if it sums to the desired value. It uses the bits of a 32 bit integer to keep track of the possibilities, and hence cannot work with more N = 31 weights.
The information on this web page is distributed under the MIT license.
subset_sum is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
python_combinatorics, a Python code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.