Click here to Skip to main content
16,016,882 members
Please Sign up or sign in to vote.
3.00/5 (1 vote)
See more:
hi can anybody tell me how to compress a link list data in c language through huffman encodng technique ?
Posted
Comments
Sergey Alexandrovich Kryukov 15-Mar-13 15:45pm    
What did you try so far?
—SA

1 solution

You will find all you need here: http://en.wikipedia.org/wiki/Huffman_coding[^].

See also the referenced to examples in this article.

Now, the question is not quite correct: the algorithm is abstracted from the content you want to compress. But it makes some sense, because a linked list is something which resides in memory, so you will need to develop serialization for your data. Please see:
http://en.wikipedia.org/wiki/Serialization#C_and_C.2B.2B[^],
http://www.boost.org/doc/libs/1_46_1/libs/serialization/doc/index.html[^] (yes, I would recommend boost serialization).

Basically, this is all you need.

Good luck,
—SA
 
Share this answer
 

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900