Haskell program that calculates a balanced partition of N items, stored in an array, where each item has a value between 0 and K such that the difference between the sum of the values of first partition, S1, and the sum of the values of the second partiton, S2, is minimised.
aaron-daly / haskell-balanced-partition Goto Github PK
View Code? Open in Web Editor NEWHaskell implementation of a balanced partition algorithm