Now available using either Java or C++ pseudocode, the text is designed to be compatible with curricula in both languages.

A section on data compression using Huffman code is included in the chapter on greedy algorithms.

A chapter on numerical algorithms includes a review of basic number theory, Euclid's Algorithm for finding the greatest common divisor, a review of modular arithmetic, an algorithm for solving modular linear equations, an algorithm for computing modular powers, and the new polynomial-time algorithm for determining whether a number is prime.

This edition features an application to cryptography, one of the most important topics in recent years. In particular, the volume includes coverage of the RSA public-key cryptosystem.