This is the knapsack problem. Find a polynomial-time solution and you will be a hero. Don
On Aug 26, 12:43 pm, Piyush Grover <piyush4u.iit...@gmail.com> wrote: > Here is a problem: > > Given an array of size n. Find all the MAXIMAL subsets whose sum is <= K. > The solution is not a concern, the optimization is required. > > -piyush -- 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.
