Algorithm:

- Variation
- Return largest sum t of elements in S

Exact-Subset-Sum(S, t)
; S = {*x*_{1}, .., *x*_{n}}

n = S

*L*_{0} = 0

for i = 1 to n

*L*_{i} = Merge-Lists(
)

remove from *L*_{i} elements > t

return largest element in *L*_{n}

S = {1, 2, 3}

*L*_{0} = 0

*L*_{1} = 0, 1

*L*_{2} = 0, 1, 2, 3

*L*_{3} = 0, 1, 2, 3, 4, 5, 6

**Analysis**

- L could double in size after each iteration
- Final merge could take 2
^{n}steps - Exponential running time