@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 <sravanreddy...@gmail.com>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 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.
