Day-26: Minimum Subset Difference Partition

This algorithm is a very basic Dynamic Programming algorithm.

It takes an array find the minimum difference of subset sums achievable by partitioning the array.

When iterating through the array, the algorithm decides whether to include the current element or not.

To do that, it makes a recursive call.

Via memoizing, it becomes very fast.

Time complexity: O(nsum)* which depends on the sum of the alements of the array.

Here is the link of my C++ implementation of Minimum Partition : Minimum Partition