How to solve the subset sum problem if the array contains -ive elements also?? For example, given an array containing +,ve and -ive elements, and a sum K, how can we find whether a subset sums upto K in array? -- Regards,* Aanchal Goyal*.
-- 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.
