Divide an array of integers into nearly equal sums - PrismoSkills

Divide an array of integers into nearly equal sums - PrismoSkills
Problem: Given an array of unsorted integers, divide it into two sets, each having (arr.length/2) elements such that the sum of each set is as close to each other as possible.


Solution: This can be done by first sorting the array (O nlogn) and then applying the following algorithm:

1. Maintain running sums for each set.
   
2. Add current largest element into the set with smaller sum and update running sums.
   
3. If any set reaches capacity n/2, then simply put remaining elements into the other set.

Read full article from Divide an array of integers into nearly equal sums - PrismoSkills