This is an optional assignment!
Summary: In our discussion of greedy algorithms, we considered Huffman's algorithm for developing optimal encodings of character strings. In this assignment, you will implement the basic version of that algorithms.
Collaboration: You should work with members of your project group on this assignment. You may also discuss the assignment with members of other project groups.
Implement a series of classes that could be used to implement Huffman coding.
Demonstrate your classes with an appropriate set of tests.
Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.
Source text last modified Fri Oct 3 08:34:44 1997.
This page generated on Fri Dec 12 12:06:16 1997 by SiteWeaver.
Contact our webmaster at firstname.lastname@example.org