Can anyone help me with a code for the following project specification?
Dynamic Huffman Encoding/Decoding program.
The algorithm to be used is "FGK" which stands for Faller and Gallager, and Knuth. This algorithm differs in its handling of first occurences, from the one I am assigned to do. This algorithm assumes a special 0-node, whereas my assignment should assume all symbols are initially equally likely (that is, all have an initial weight of 1.) The encoder and decoder should be two different classes.