Log In

I Need The Support About My Assignment

I’m working on a algorithms & data structures question and need guidance to help me study.

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

Output: [[1,66], [2,65], [3,64],…..[1,2,64],………  [1,2,3,61],……..[1,2,3,4,57],……] [e.g. all possible combinations  of the integers that produce the target sum 67]

1. Implement the above subset sum problem by your own approach or modifying the select_k_of_n program from chapter 9.  You will find the code in the corresponding Resources sections.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                     

2. Explain the time complexity of the above  program.

× How can I help?