Problem:

We have n=6, W={3,5,7,8,9,15} & M=20

So the solution of the problem is shown below

Algorithm:

Sumofsub(s, k, r)

{

//generate left child

If(s+w[k]=m) then write (x(1:k));//subset found

else if (s+w[k]<=m)

then sumofsub(s+w[k], k+1, r-w[k]);

//generate right child and evaluate Bk

If((s+r-w[k]>=m) and (s+w[k+1]<=m)) then

{

x[k]=0;

sumofsubset(s, k+1, r-w[k]);

}

}