huffman encoding in c

Question

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 15-Mar-13 9:34am

Comments

Sergey Alexandrovich Kryukov 15-Mar-13 15:45pm

What did you try so far?
—SA

1 solution

Add a Solution

Treat my content as plain text, not as HTML

…

Sign in to your account

Download, Vote, Comment, Publish.

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

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

Sergey Alexandrovich Kryukov · Answer 1 · 2013-03-15T09:45:00

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