Consider the subset sum problem:

1) Given X={4,8,1,2,7,14,9} and T=19, give two solutions for this problem

2) Take a look at the code solving this problem page 77, why is this algorithm considered a backtracking algorithm?

3) What is the time complexity of this algorithm? How do you qualify it? (good, bad....)

4) Let's suppose that you need to implement this algorithm and that you have chosen to represent X by an array.

What would be the issue?

algorithm analysis