An example of how to use STL priority queues, with an implementation of Huffman coding as an example.
Mark Nelson
Programming, mostly.
Archive for January, 1996
Bookmarks/Feeds
Categories
Standards Scams Humor VoIP Work Culture Hackery Writing Snarkiness Video Graphics People Audio Web Articles Business Computer Science Programming Complaining Magazine Articles Data Compression
Recent Entries
- Innumeracy Part N
- Slate Rips Me Off
- Another One Bites the Dust
- English as a Foreign Language - A Cautionary Tale
- How Evil Is Apple?
- Cashing in On Electronic Books
- Jerome Kerviel, My Hero
- I Trust American Express With My Money?
- Algorithms Crossword
- Help Needed
Blogroll
- Joey Nelson - Joey Nelson
- Obviosaurus.com - It's obvious
My Books
Archives
Recent Comments
- Marauder in Building Your Home Video Jukebox
- Ernst in The Million Random Digit Challenge …
- Mark Nelson in zlib - Looking the Gift Code in the…
- Zuffi in zlib - Looking the Gift Code in the…
- funman in LZW Data Compression
- suffix tree res… in Fast String Searching With Suffix T…
- ziman in Fast String Searching With Suffix T…
- Mark Nelson in Managing the Heap
- anoop in Managing the Heap
- obfuscated in Intel's JPEG Library