Question: The Subset Sum problem asks, given a set X of n positive integers (represented as an array X[1..n] and an integer T, whether any subset
The Subset Sum problem asks, given a set X of n positive integers (represented as an array X[1..n] and an integer T, whether any subset of X sums to T.
Describe and analyze an ecient algorithm that solves the Subset Sum problem. In particular, your algorithm should run in O(nT) time.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
