- #1
DODGEVIPER13
- 672
- 0
I am going to be compleley honest, I don't know anything about Huffman coding. Except that I think I understand the Huffman tree algorithm. Can anyone assist me in getting started the problems states:
The preceding exercise compresses a file to generate
two files filename.huf and filename.new. Write a program that decompresses
the file. The program prompts the user to enter the file name and
decompresses it into a file named filename
Sorry I don't have any code but the copy and paste feature always jumbles up the format and I don't wish to manuallly enter it. If you have the book it is Introduction To Java Programming 8th ed written by Daniel Liang
The preceding exercise compresses a file to generate
two files filename.huf and filename.new. Write a program that decompresses
the file. The program prompts the user to enter the file name and
decompresses it into a file named filename
Sorry I don't have any code but the copy and paste feature always jumbles up the format and I don't wish to manuallly enter it. If you have the book it is Introduction To Java Programming 8th ed written by Daniel Liang