Given n positive integers with total sum less than 2^n-1, the algorithm efficiently finds two distinct subsets with equal subset sums.
