A new data compression technique, using a text transform discovered by Wheeler and Burrows. Detailed source code accompanies the article.

continue reading.....

Suffix trees provide the extraordinary ability to search through an unlimited amount of text for a given string of length N in O(N) time. This article describes the structure of a suffix tree and provides C++ source for a simple suffix tree generation algorithm.

continue reading.....

An example of how you can run into trouble when performing floating point comparisons.

continue reading.....

An example of how to use STL priority queues, with an implementation of Huffman coding as an example.

continue reading.....