Foundations of Algorithms, Fifth Edition offers a well-balanced presentation of
algorithm design, complexity analysis of algorithms, and computational
complexity. Ideal for any computer science student with a background in college
algebra and discrete structures, the text presents mathematical concepts using
standard English and simple notation to maximize accessibility and
user-friendliness. Concrete examples, appendices reviewing essential
mathematical concepts, and a student-focused approach reinforce theoretical
explanations and promote learning and retention. C++ and Java pseudocode help
students better understand complex algorithms. A chapter on numerical algorithms
includes a review of basic number theory, Euclids Algorithm for finding the
greatest common divisor, a review of modular arithmetic, an algorithm for
solving modular linear