# elm-partition

The partition problem is a mathematically [NP-complete](https://en.wikipedia.org/wiki/NP-completeness) task which splits a set of numbers _S_ 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.

## Roadmap

- [x] Brute force method
- [ ] pseudo-polynomial
- [ ] greedy
- [ ] largest differencing
- [ ] anytime

## License


[![FOSSA Status](https://app.fossa.io/api/projects/git%2Bgithub.com%2FLibbum%2Felm-partition.svg?type=large)](https://app.fossa.io/projects/git%2Bgithub.com%2FLibbum%2Felm-partition?ref=badge_large)