subsetsum2(A,n,k):
| Input array A, index n, target sum k
| Output true if some subset of A[0..n-1] sums up to k
| false otherwise
|
| if k=0 then
| return true // empty set solves this
| else if n=0 then
| return false // no elements => no sums
| else
| return subsetsum(A,n-1,k-A[n-1]) or subsetsum(A,n-1,k)
| end if
|