@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 <rajeevr...@gmail.com> 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 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?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 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?hl=en.
