NP-COMPLETE 2009/8/14 fundoonick <fundoon...@yahoo.co.in>
> Problem: > I have a set of positive integers. I have to divide it into 2 sets such > that the difference of the sums of both sets is minimum. > For ex, the given set of +ve integers is: 1,2,3,4 > I divide it into 2 sets {1,4} and {2,3} such that the difference of their > sum (1+4=)5 - (2+3=)5 = 0 > This is the least possible difference. > > Pls help. > > > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---