Skip to content

Sum of subsets #9

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Jun 6, 2019
Merged

Sum of subsets #9

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
931f621
Create Code.java
sandeepsj Jun 6, 2019
773c8b4
Create README.md
sandeepsj Jun 6, 2019
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
97 changes: 97 additions & 0 deletions Backtracking/Sum of subsets/Code.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,97 @@
// import visualization libraries {
import org.algorithm_visualizer.*;
import java.util.Random;
// }

class Main {
// define tracer variables {
Array1DTracer array1dTracer = new Array1DTracer("Set");
LogTracer logTracer = new LogTracer("Console");
// }

// define input variables
int n;
int s[];
int d;

void solve()
{
int[] sel=new int[n+1];
int k=0,sum=0,found=0;
sel[0]=1;
array1dTracer.select(k);
Tracer.delay();
while(true) {
if(k<n && sel[k]==1) {
if(sum+s[k]==d)
{
found=1;
logTracer.print("{");
for(int i=0;i<n;i++)
if(sel[i]==1)
logTracer.print(s[i]+" ");
logTracer.println("}");
sel[k]=0;
Tracer.delay();
array1dTracer.deselect(k);
Tracer.delay();
}
else if(sum+s[k]<d)
sum+=s[k];
else{
sel[k]=0;
array1dTracer.deselect(k);
Tracer.delay();
}
}
else
{
k--;
while(k>=0 && sel[k]==0)
k--;
if(k<0)
break;
sel[k]=0;
array1dTracer.deselect(k);
Tracer.delay();
sum-=s[k];
}
k++;
if(k<n){
sel[k]=1;
array1dTracer.select(k);
Tracer.delay();
}
}
if(found==0)
logTracer.println("Not possible subsets");
}

Main() {
// visualize {
Layout.setRoot(new VerticalLayout(new Commander[]{array1dTracer, logTracer}));
Tracer.delay();
// }
n=10;
//Randomizing the array{
s=new int[n];
Random r=new Random();
for(int i=0;i<n;i++)
s[i]=r.nextInt(30);
d=r.nextInt(100);
//}

logTracer.print("The Given set is: ");
for(int x:s)
logTracer.print(x+",");
logTracer.println("\nDesired sum is:"+d);
logTracer.println("The possible subsets of sum "+d+" are: ");
array1dTracer.set(s);
Tracer.delay();
solve();
}

public static void main(String[] args) {
new Main();
}
}
10 changes: 10 additions & 0 deletions Backtracking/Sum of subsets/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@

# Sum of Subset using BackTracking






## References
-[Geeksforgeeks](https://www.geeksforgeeks.org/subset-sum-problem-dp-25/)