Sorry for not understanding the problem at first...
I hope this solution will find the all the subsets from set S . The sum of
elements in subset is equivalent to certain k.
fun(int a[],int k){
int i,j;
int k1;
for(i=0;i<10;i++){
Hi!
It's me Ali!
I would like to invite you to join my network on MyGreenGroup.com.
Once you join, you will immediately be connected to all the people in my social
network.
MyGreenGroup.com is an online service that lets you find old friends and meet
new people. You may also show yourself her
Yes, you do know S. The problem statements says find the *subset* of S
that sums to k, if any.
Not knowing S does not make any sense anyway. S and k are an instance
of SUBSET-SUM.
On Apr 2, 8:41 am, "pramod" <[EMAIL PROTECTED]> wrote:
> Dor,
>
> If I understand the problem correctly, we don't kno
