laziness, impatience, and hubris | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
> This is an NP-complete problem http://en.wikipedia.org/wiki/Knapsack_problem
Yes, to be precise a sub class known as "Partition Problem". See WP article for some efficient algorithms and further links. I wonder who and why is posting well known scientific problems w/o references ...? Cheers Rolf ( addicted to the Perl Programming Language) In reply to Re^3: Divide an array into 2 subsets to verify their sum is equal or not. (Partition Problem)
by LanX
|
|