Skip to content
This repository was archived by the owner on Oct 22, 2021. It is now read-only.
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
36 changes: 36 additions & 0 deletions Dynamic Programming/Subset Sum/Subset Sum.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
class SubsetSum {


public static void main(String args[])
{
int set[] = { 5, 3, 4, 1, 8, 2 };
int sum = 8;
int n = set.length;
if (sumOf(set, n, sum) == true)
System.out.println("Found a subset");

else
System.out.println("Not Found");

}


static boolean sumOf(int set[],int n, int sum)
{

if (sum == 0)
return true;
if (n == 0)
return false;


if (set[n - 1] > sum)
return sumOf(set, n - 1, sum);


return sumOf(set, n - 1, sum) || sumOf(set, n - 1, sum - set[n - 1]);
}



}