@ The following link might help.. http://groups.google.com/group/algogeeks/browse_thread/thread/8a58ea05c96f811b?hl=en#
Basicaly if A[N, Wmax] = 1, then find all subsets using backtracking.. where, N = no. of elements, Wmax = 4... On Jan 6, 7:50 pm, atul anand <[email protected]> wrote: > @shady , prakash : we have to find all combination , not one so could you > providelittle more explanation by using 0-1 knapsack. > > @ sravanreddy001: yeah it should be O(2^n). > > On Fri, Jan 6, 2012 at 8:07 PM, sravanreddy001 > <[email protected]>wrote: > > > > > > > > > @atul007: When you mean n^2 solution.. did you mean the DP which actually > > is 2^n?? > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To view this discussion on the web visit > >https://groups.google.com/d/msg/algogeeks/-/MrOfjqZKk8YJ. > > > 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.
