if you don't distroy the oder in which elements are stored in array then this problem is just a cake walk.
Requirement of question? On Jan 19, 11:49 am, Aditya <adit.sh...@gmail.com> wrote: > this could be solved by using dynamic programing (knapsack problem) > > On 1/19/2011 12:30 AM, juver++ wrote: > > > Did you mean absolute difference between two subsets is minimal? -- > > 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. > > -- > Regards Aditya -- 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.
