The partition problem is a mathematically NP-complete task which splits a set of numbers into two subsets, where the sum of these subsets is equal.
This library implements a number of different methods to obtain the subsets—some optimal and some fast.
- Brute force method
- pseudo-polynomial
- greedy
- largest differencing
- anytime
