@anshu then shall we use the foll reccurence realation?? 1<i<=n S=(s+1)/2
f(i,S)= min( f(i-1, S), f(i-1, S- ar[i]) ) On Mon, May 9, 2011 at 10:42 AM, anshu <[email protected]> wrote: > Use KnapSack DP. suppose the sum of element = s and number of elements > = n make a 2-dimesnsional array of size n * ((s+1)/2); I think that > much hint is enough. > > if we think little bit more we can optimize it also. > > -- > 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. > > -- Gaurav Aggarwal SCJP -- 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.
