In this new edition of their text, Neapolitan and Naimipour (both Computer Science, Northeastern Illinois University) use standard English and simplified notation to introduce students to algorithm design, complexity analysis of algorithms, and computational complexity. Students' grasp of theoretical concepts are reinforced by numerous examples. Three appendices contain a review of essential mathematical concepts and a CD-ROM contains the required C++ and Java pseudo source codes. Annotation ©2010 Book News, Inc., Portland, OR (booknews.com)