Foundations of Algorithms

by Richard E. Neapolitan, Kumarss Naimipour

Foundations of Algorithms, Fourth Edition offers a well-balanced presentation of algorithm design, 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. A CD-ROM is included with every new copy of the text and allows students to have easy access to the necessary C++ and Java pseudo source codes.

Genres: Computer Science, Algorithms

627 pages, Hardcover

First published June 3, 1996

Reviews

[Ro Givens · Rating 4 out of 5]

I really like the structure of this book (by algorithm type instead of by problem), but I'm not a big fan of the pseudocode used.

[Manoj]

i want to download