If I understand correctly this is subset-sum problem and is NP- Complete.
On Apr 30, 9:04 am, Cool_Happy <[EMAIL PROTECTED]> wrote: > Suppose u r given a positive number N. > How will we find a set of distinct positive numbers having sum equal > to N. > There could be multiple such sets so what is the algo to find all > those sets. > > TIA > Negi --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
