is it a contiguous set, any sparse subset or what? if it's a subset of a set then it can be sparse, but when you say "array" you make it quite tricky to figure out.
with all due respect sir, please mind that when you make a question you're taking peoples time to answer it therefore if the answer is useless to you you'd have wasted someone else's time with no reason. so please, I gently ask you to make a clear question next time. On Mon, Oct 10, 2011 at 11:47 AM, Rashmi Jain <[email protected]> wrote: > algo to find subsets of an array whose sum is equal to a given number..? > > -- > 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. > -- Hatta -- 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.
