Pseudo-polynomial Time Algorithm
The problem can be solved using dynamic programming when the size of the set and the size of the sum of the integers in the set are not too big to render the storage requirements infeasible.
Suppose the input to the algorithm is a list of the form:
- S = x1, ..., xn
Let N be the sum of all elements in S. That is: N = x1 + ... + xn. We will build an algorithm that determines if there is a subset of S that sums to . If there is a subset, then:
- if N is even, the rest of S also sums to
- if N is odd, then the rest of S sums to . This is as good a solution as possible.
Read more about this topic: Partition Problem
Famous quotes containing the word time:
“Once we have found ourselves, we must understand how from time to time to lose—and then to find—ourselves once again: assuming, that is, that we are thinkers. For a thinker it is a drawback to be bound to a single person all the time.”
—Friedrich Nietzsche (1844–1900)