Data Structures and Algorithms Part XVI - The Huffman Compression Algorithm (Part 2)

By Alison Neal

Posted February 25 2003

Summary: In her latest installment, Alison Neal discusses the Huffman compression algorithm, which is the same compression algorithm that is used by PkZip. The algorithm yields approximately 40% compression for text files. The test application included with the article reduces the provided test file from 20kb to 12kb in size, and then decompresses it back to its original state. Part 2 of 2.

Please log on to read this subscriber-only article. If you do not have a subscription you can purchase one in the ClarionMag store.

Clarion Roadmap

Try the roadmap (beta)

Search ClarionMag

 

Advanced search

From the archives

Clarion# And The Google Calendar API

12/17/2007 12:00:00 AM

Randy Rogers shows how to use the Google Calendar API to add public and private calendars to your Clarion# applications.