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

If you had an algorithm that found the best possible partition and there is one with difference 0 (for some array of integers) then your algorithm would find that one, otherwise you would find a difference>0. So your algorithm would be a solution to the partition problem.
  • Comment on Re^3: Divide array of integers into most similar value halves

In Section Seekers of Perl Wisdom