Huffman Algorithm In C.

What do you know about working with bits? Do you know how to set them and shift them?

Usually you will have yourself a little function that takes a specific number of bits (let's say just one bit at a time for each branch in the tree).

The function will modify a static "bits" variable (say, one byte) by shifting in the new bit, and incrementing another static "count" variable that keeps track of the number of bits stored in the byte. Once the counter hits eight (for one byte == eight bits), the byte is written to the output stream, and the "bits" and "count" variables are reset to zero.

You will also need a "final" function that flushes bits remaining when your huffman stream doesn't produce a multiple of eight bits (since the last byte won't be completely filled, but it must still be output).

Hope this helps.

Thanks For Your Solution ................i`ll Soon Try To Implement That And Will Report You And Again Ask For Guidance If Required.............well What Is Profession Nwdays And Your Country..............

Glad you found a possible solution.
If you're going to stick around could you do us a favor?
Could you stop Capitalizing at random some ( most ) of the words? It makes your post hard to read.
And we could live without the ..................... as well, it doesn't do anything to enhanced your
writing, but the contrary is true.

well every person has its own style to communicate..............thats what this is................

>well every person has its own style to communicate
>..............thats what this is................
And every person has the right to ignore styles they find difficult to follow. Get used to it.