Computer Science Homework Help

North American College Subset Sum Problem Algorithm Analysis

 

Input : [1,2,3,,4,………….., 20], Target sum of integers = 23

Output: [[3,20], [4,19], [5,18],…..[1,2,20],……… [1,2,3,17],……..[1,2,3,4,13],……] [e.g., all possible combinations of the integers that produce the target sum 23]

1. Implement the above subset sum problem. Marks 90

2. Explain the time complexity of the above program. Marks 10

Total 100

You need to cite the respected resources.

Note : I need java code, and related screenshots, and also bracket for codes. Because I need to run on my eclipse.