Sum of any number of elements on the two partitions should be as close as possible.
On Tue, Jul 26, 2011 at 6:49 PM, Puneet Gautam <[email protected]>wrote: > @rshetty: do u mean the sum of any no of elements separately in the > two partitions be equal to each other..? is that what u mean..? > > On 7/26/11, rShetty <[email protected]> wrote: > > Problem statement goes as : > > > > Consider square root of integers form 1 to 100. Now partition the > > square roots of integers as being from 1 to 50 and 51 to 100. > > Now find the sum in the two partitions which is as close as possible > > or minimum? > > Give the algorithm ?? and das structures to be used?? > > > > -- > > 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. > > > > > > -- > 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. > > -- Regards Rajeev N B <http://www.opensourcemania.co.cc> -- 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.
