Question

Divide set into subsets with minimum difference in sum

Answer 1

Answer:

This is the idea that I have, but I am not sure if this is a correct solution:

1) Sort the array

2) Take the first 2 elements. Consider them as 2 sets (each having 1 element)

3) Take the next element from the array.

4) Decide in which set should this element go (by computing the sum => it should be minimum)

5) Repeat.

⚡Hope it works.⚡