Sum up all the number and divide by 2 Using the algorithm subset problem to find a number close to median
Wladimir Araujo Tavares *Federal University of Ceará * On Wed, Dec 29, 2010 at 2:07 PM, Ankur Khurana <[email protected]>wrote: > How will you divide and array of approx 100 elements into two sub sets > of 50 each such that the difference between both the subsets is the > minimum possible one . . > > Thanks in advance . > Ankur > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
