@hackage / huffman

Pure Haskell implementation of the Huffman encoding algorithm

Latest1.0.2

About

Metadata

  • Last updated , by MaximeHenrion
  • License BSD-2-Clause

  • Maintained by: Maxime Henrion <mhenrion@gmail.com>

  • Lottery factor: 1

Links

Installation

Readme

A simple and pure Haskell implementation of the Huffman encoding algorithm. . The huffman function provides the original O(n log n) algorithm implemented with a priority queue. If the input symbols are sorted by probability, the O(n) huffmanSorted function can be used instead.