Getting the lowest possible sum from numbers' difference

Question

I have to find the lowest possible sum from numbers\' difference.

Let\'s say I have 4 numbers. 1515, 1520, 1500 and 1535. The lowest sum of difference is 30, becaus

Answer 1

I would go with answer of marcog, you can sort using any of the sorting algoriothms. But there is little thing to analyze now.

If you have to choose R numbers out N numbers so that the sum of their differences is minimum then the numbers be chosen in a sequence without missing any numbers in between.

Hence after sorting the array you should run an outer loop from 0 to N-R and an inner loop from 0 to R-1 times to calculate the sum of differnces.

If needed, you should try with some examples.