Re^5: Divide an array into 2 subsets to verify their sum is equal or not. (Partition Problem)

> There are some very talented people in this community

Unlikely, and during my studies of mathematics this was considered extremely unfair!

These are well investigated problems known to be very hard and w/o optimal solution but already good practical solutions.

They shouldn't be disguised as a hackers question.

Cheers Rolf

( addicted to the Perl Programming Language)

Comment on Re^5: Divide an array into 2 subsets to verify their sum is equal or not. (Partition Problem)

Replies are listed 'Best First'.
Re^6: Divide an array into 2 subsets to verify their sum is equal or not. (Partition Problem) by hdb (Monsignor) on May 03, 2013 at 12:11 UTC
See also: http://www.amazon.com/Uncle-Petros-Goldbachs-Conjecture-Mathematical/dp/1582341281/ref=la_B002QTGPQ6_1_2?ie=UTF8&qid=1367582989&sr=1-2	[reply]
Re^7: Divide an array into 2 subsets to verify their sum is equal or not. (Partition Problem) by LanX (Saint) on May 03, 2013 at 12:14 UTC
That's why. Some drugs have to be handled professionally. Don't offer opium and disguise it as coffee. Cheers Rolf ( addicted to the Perl Programming Language)	[reply]