in reply to Re^2: Divide array of integers into most similar value halves
in thread Divide array of integers into most similar value halves

But to find out if your solution is the best partition (and it's value is not sum/2) you have to check if there is a possible better partition, which means checking if the partition with the value sum/2 exists. Thus you have to solve the partition problem. D'oh.
  • Comment on Re^3: Divide array of integers into most similar value halves

In Section Seekers of Perl Wisdom