I ve been wondering how to solve this problem. There exists a set of numbers. We group the numbers into several groups, say 3. Now we group the elements present in the original set into these 3 groups so that there is minimum difference between different groups when their elements are added together.
Eg. 3,3,3,3,3,3,9 grouped into (9), (3,3,3) and (3,3,3). Here difference between any 2 groups is minimum and cannot be reduced further.
Is this possible? Is there a generalized solution to this problem?