huffman: Pure Haskell implementation of the Huffman encoding algorithm

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.

Modules

[Index] [Quick Jump]

Downloads

• huffman-1.0.2.tar.gz [browse] (Cabal source package)
• Package description (as included in the package)

Maintainer's Corner

Package maintainers

• MaximeHenrion

For package maintainers and hackage trustees

• edit package information

Candidates

• 1.0.2