Re^3: Divide array of integers into most similar value halves

Strange! The german wikipedia page states "Gesucht wird eine Aufteilung dieser Zahlen auf zwei Haufen, so dass die Differenz der Summen der Zahlen in den beiden Haufen möglichst klein ist." (Find a partition such that the diffference of the sum of each heap is minimal). And this is exactly what you're after.

s$$([},&%#}/&/]+}%&{})*;#$&&s&&$^X.($'^"%]=\&(|?*{%
+.+=%;.#_}\&"^"-+%*).}%:##%}={~=~:.")&e&&s""`$''`"e

Comment on Re^3: Divide array of integers into most similar value halves Select or Download Code

Replies are listed 'Best First'.
Re^4: Divide array of integers into most similar value halves by Pepe (Sexton) on Sep 01, 2008 at 20:13 UTC
I guess I'll be totally fine with that if the German definition is true and there is a way of implementing that in perl. Any ideas on how to do it? I can't read German.	[reply]
Re^5: Divide array of integers into most similar value halves by Skeeve (Parson) on Sep 02, 2008 at 04:21 UTC
I think you did not read about the problem or did not understand what you read. However. An algorithm for that problem can be found (in english) on arXive.org. `s$$([},&%#}/&/]+}%&{});#$&&s&&$^X.($'^"%]=\&(\|?{%` `+`.+=%;.#_}\&"^"-+%*).}%:##%}={~=~:.")&e&&s""`$''`"e	[reply] [d/l] [select]