*Hi,*
*
*
*I wonder that if the element of the array contains negative integer?
*
On Wed, Dec 22, 2010 at 1:25 AM, snehal jain wrote:
> There is an array, how will you partition that into two parts so that
> the sum of both the sub set is minimum
>
> --
> You received this message because you are
@saurabh Sum of all the elements of subset.
On Tue, Dec 21, 2010 at 11:42 PM, Saurabh Koar wrote:
> "sum of both the sub set is minimum" means
>
> sum of subset1+sum of subset = constant(=sum of the total array)
> When one decreases the other increases.
>
> Plzz give an example.
>
> --
> You
I guess this is subset partitioning problem and a motivating problem for NP
complete theory.Even sorting can't help here.Correct me if i am wrong.
On Tue, Dec 21, 2010 at 10:55 PM, snehal jain wrote:
> There is an array, how will you partition that into two parts so that
> the sum of both the su
"sum of both the sub set is minimum" means
sum of subset1+sum of subset = constant(=sum of the total array)
When one decreases the other increases.
Plzz give an example.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this g
There is an array, how will you partition that into two parts so that
the sum of both the sub set is minimum
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from
