##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Split the array into two halves. Generate all subset sums for each half.
Compute all sums for the first half: .
Compute all sums for the second half: .
Sort one list.
For each sum in the first list, binary search for in the second list to find the closest match.
Total time: .
