18CSL47 || Lab Program 11 || Design and Analysis of Algorithms Laboratory || VTU 4th SEM CSE
11. Design and implement in Java to find a subset of a given set S = {S1, S2,..., Sn} of n positive integers whose SUM is equal to a given positive integer d. For example if S = {1, 2 , 5, 6, 8} and d = 9, there are two solutions {1,2,6} and {1,8}. Display a suitable message, if the given problem instance doesn't have a solution.
Link for Sum of subset problem video:
• 18CS42 MODULE 5 DESIGN AND ANALYSIS OF ALG...