# LinearSplit: Partition the sequence of items to the subsequences in the order given

The LinearSplit module implements partitioning the sequence of items to the subsequences in the order given. The items can be splitted using greedy heuristic or using linear partition algorithm to minimize the maximum cost over all ranges (see the 'The Algorithm Design Manual' by Steven S. Skiena..)

[Skip to Readme]

## Downloads

- LinearSplit-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)

#### Maintainer's Corner

For package maintainers and hackage trustees

Candidates

- No Candidates

Versions [RSS] | 0.1, 0.2, 0.2.1 |
---|---|

Dependencies | array, base (>=3.0.3.2 && <5), cmdargs (>=0.3), haskell98, QuickCheck (>=1.2.0.1) [details] |

License | BSD-3-Clause |

Author | Vitaliy Rukavishnikov |

Maintainer | virukav@gmail.com |

Category | Algorithms |

Home page | http://github.com/rukav/LinearSplit |

Bug tracker | mailto:virukav@gmail.com |

Uploaded | by VitaliyRukavishnikov at 2011-02-17T13:54:12Z |

Distributions | NixOS:0.2.1 |

Reverse Dependencies | 1 direct, 0 indirect [details] |

Downloads | 2979 total (6 in the last 30 days) |

Rating | (no votes yet) [estimated by Bayesian average] |

Your Rating | |

Status | Docs uploaded by user Build status unknown [no reports yet] |