Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am sure you have already heard about this problem. Given a list of natural numbers, is it possible to divide them into two piles of equal sums? If yes, write two lines with objects in each pile.
Is this some well-known problem? Does it have a name? Is it NP-Complete? If not, what is the fastest solution?
This is the Partition problem, which is NP-Complete. It is a variant of Subset SUM.
Which is the fastest, really depends on the data you have. For instance, if they were bounded, you could use dynamic programming etc.