The Huffman algorithm uses a binary tree, and has complexity O(N*N) for compression and O(NlogN) for decompression. Although this file compressor is not so good as other compression programs (like gzip), HFFzip is right for embedded systems, because of its little size and the simple algorithm used.

WWW: http://retis.sssup.it/~scordino/projects/hffzip.html
