our project is about enhancing the huffman algorithm that would be able to compress text, .exe and graphics, and would be able to surpass the existing compression techniques for the said variation of files. The algorithm for the Huffman is :
1.For each symbol create a tree with a single root node and order all trees according to the probability of symbol table
2. While more than one tree is left take the two trees t1,t2, with the lowes frequencies f1,f2,(f1 less than or equal to f2)and create a tree with t1 and t2 as its children and with the frequency in the new root equal to f1 + f2;
3. Associate 0 with each left branch and 1 with each right branch.
4. Create a unique code for each symbol by traversing the tree from the root to the leaf containing the frequency corresponding to this symbol and by putting all encountered 0s and 1s together.
thanks in advance.