It's not knapsack in knapsack we find max or min subset here we have to find all subsets <=k not just one which is min or max , so I guess we have to form all subsets and check their sum hence the algoritm will be 0(2^n) where n is number of elements in the set ,
please correct me if i am wrong or a better solution exists thanks -- 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.
