linear-partitioning

Given an array of numbers, partition them into a number of buckets, preserving order, where the ranges of each bucket are as close as possible.

npm install linear-partitioning
9 downloads in the last week
17 downloads in the last month

The Partition Problem

See http://www8.cs.umu.se/kurser/TDBAfl/VT06/algorithms/BOOK/BOOK2/NODE45.HTM

Input: given an array of S non-negative numbers and an integer k (the number of partitions we want)

Output: Partition S into k ranges, so as to minimize the maximum sum over all the ranges.

var partition = require('linear-partitioning');

partition([1,2,3,4,5,6,7,8,9], 3);
> [[1,2,3,4,5], [6,7], [8,9]]
npm loves you