This week's book giveaways are in the Refactoring and Agile forums.We're giving away four copies each of Re-engineering Legacy Software and Docker in Action and have the authors on-line!See this thread and this one for details.
Win a copy of Re-engineering Legacy Software this week in the Refactoring forum
or Docker in Action in the Agile forum!

# Sorting 10 numbers

Sam Benry
Ranch Hand
Posts: 89
I'm basically looking for a good algorithm or method to do the following:
I have 10 numbers, you can use List<Integer> or int[] or what ever you want.

I want to sort the 10 numbers so the sum of the first 5 is approximately (or exactly if possible) equal to the sum of the last 5. The sum of the first 5 must be as close as possible to the sum of the last 5.

How can I do that?
Thank you.

saumil baxi
Ranch Hand
Posts: 58
one solution can be. If I have understood your problem correctly

Sort the numbers in such a way that .

You place the latest number at the last index.
Then Second latest at the first location.
Third Latest at Second last location and so on.

The sum of the first five elements would be close to sum of last five element in your List.

fred rosenberger
lowercase baba
Bartender
Posts: 12085
29
saumil baxi, I don't think that will work. What if your set of numbers were

1,2,3,4,5,6,7,8,9,100

group 1: 100, 8, 6, 4, 2: Sum is 120
group 2: 9, 7, 5, 3, 1: Sum is 25
diff = 95

But this would be a better way to do it:

group 1: 100, 1, 2, 3, 4: Sum = 110
group 2: 5,6,7,8,9: Sum = 35
diff = 75

I think your best bet is to go through the numbers from largest to smallest. Add each number to whichever group has the lowest sum. If the sums are the same, it doesn't matter.

I haven't proved to myself this is the correct way to go, but it feels right to me...

Sam Benry
Ranch Hand
Posts: 89
Interesting, I wrote this quickly, what do you think ?

saumil baxi
Ranch Hand
Posts: 58
Fred you are right [ ]..