Created
April 8, 2013 14:28
-
-
Save vikashvverma/5337181 to your computer and use it in GitHub Desktop.
This program implement sum of subset algorithm in C... :D
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
void sumOfSub(int,int,int); | |
static int m=0; | |
int*w; | |
int*x; | |
void main() | |
{ int i=0,sum=0,n=0; | |
printf("Enter size of array: "); | |
scanf("%d",&n); | |
w=(int*)malloc(sizeof(int)*n+1); | |
x=(int*)malloc(sizeof(int)*n+1); | |
printf("Enter %d elements: ",n); | |
for(i=1;i<=n;i++) | |
{ | |
scanf("%d",&w[i]); | |
sum+=w[i]; | |
x[i]=0; | |
} | |
printf("Enter the sum to be obtained: "); | |
scanf("%d",&m); | |
if(sum<m) | |
{ | |
printf("Not possible to obtain any subset !!! "); | |
exit(1); | |
} | |
printf("Possible Subsets are( 0 indicates exclusion and 1 indicates inclusion) : "); | |
sumOfSub(0,1,sum); | |
} | |
void sumOfSub(int s,int k,int r) | |
{ int i=0; | |
x[k]=1; | |
if(s+w[k]==m) | |
{ printf("\n"); | |
for(i=1;i<=k;i++) | |
printf("\t%d",x[i]); | |
} | |
else if((s+w[k]+w[k+1])<=m) | |
{ | |
sumOfSub(s+w[k],k+1,r-w[k]); | |
} | |
if((s+r-w[k])>=m && (s+w[k+1])<=m) | |
{ | |
x[k]=0; | |
sumOfSub(s,k+1,r-w[k]); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment