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 u 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?

Thanks.