| Current Forum: Homework 4 - Huffman Trees (Part 1) |
| Date: Mon Oct 8 2001 8:54 am |
| Author: Lee, Peter <petel@cmu.edu> |
| Subject: Re: Speed of Huffman Tree |
|
|
There is no set speed requirement. If you use Huffman's algorithm, you should be OK.
As for test file size, no test files will be large. I'll have to let Mike tell us a max size.
For Huffman compression, I/O is indeed a bottleneck, particularly because on ehas to read the file twice. |
|