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)
In reply to Re^5: Divide an array into 2 subsets to verify their sum is equal or not. (Partition Problem)
by LanX
in thread Divide an array into 2 subsets to verify their sum is equal or not.
by bimleshsharma
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |