This is a NP hard problem. There is no efficient way to solve it quickly, though if you have small numbers you can do it with Dynamic Programming in a way very similar to the Knapsack problem in O(sum*n) time, where "sum" is sum of all the integers and 'n' is the number of integers you have.
-Dhyanesh On 7/8/06, valpa <[EMAIL PROTECTED]> wrote: > > give a set with n integers, partition it into two sets with equal > sum-value > how can I do it efficiently? > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
