Back Cover*Foundations of Algorithms Using C++ Pseudocode, Third Edition* offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts. After *Foundations of Algorithms using C++ Pseudocode, Third Edition* introduces students to algorithms and analysis of algorithms in Chapter 1, the authors have developed separate chapters on the divide-and-conquer approach, dynamic programming, greedy algorithms, backtracking algorithms, and branch-and-bound algorithms. Immediately after, the authors explore analysis of problems, and in particular, a chapter on analyzing the sorting problem followed by one on analyzing the searching problem. Following this progression, the authors introduce the theory of NP in a rigorous but yet intuitive, lucid fashion. It is at this point that the book then takes a shift in pedagogy and presents a chapter that is concerned with solving a certain type of problem rather than algorithms that share a common technique. Specifically, numerical algorithms are discussed, as well as the inclusion of the new polynomial-time algorithm for determining whether a number is prime. Finally, the author's provide a final chapter concerning parallel algorithms and applications to cryptography.