This is an Elixir project demonstrating implementations of algorithms that solve the Partition problem.
- Clone this repo.
- Run
mix deps.get - If you want to play with the code in the shell, run
iex -S mix - If you want to immediately run the tests:
mix test
Create a function in lib/pp.ex whose name starts with impl_ and is preferrably ending with your GIT username. The function must accept a single argument -- list of integers. It must return a tuple of size 4 containing (1) the left list, (2) the right list, (3) the sum of the elements in the left list, and (4) the sum of the elements in the right list. Check the first reference implementation for a working example.
As long as you adhere to the above specification of your function in the PP module then simply running mix test will check all implementations, yours included.
The author is open to PRs containing alternative implementations. PRs that change the default unit tests and introduce additional property tests are welcome as well.
Additionally, the plan is to add benchmarking if there is more than one implementation.