Algorithm Design: Foundations, Analysis, and Internet Examples

by Michael T. Goodrich, Roberto Tamassia

Are you looking for something different in your Algorithms text? Are you looking for an Algorithms text that offers theoretical analysis techniques as well as design patterns and experimental methods for the engineering of algorithms? Michael Goodrich and Roberto Tamassia, authors of the successful, Data Structures and Algorithms in Java, 2/e, have written Algorithm Design, a text designed to provide a comprehensive introduction to the design, implementation and analysis of computer algorithms and data structures from a modern perspective. Written for an undergraduate, junior-senior algorithms course this text offers several implementation case studies and uses Internet applications to motivate many topics such as hashing, sorting and searching.

Genres: Computer Science, Programming

720 pages, Paperback

First published October 15, 2001

Reviews

[Wooi Hen Yap]

Of all the algorithm books I have read, this one has the most comprehensive coverage on graph data structure, shortest path and P-NP problems. Good things are they presented in a way a layman can understand without assuming much background knowledge. I would recommend people studying CS to own this book.

[Jugal · Rating 3 out of 5]

Not very good. I liked it for its comprehensiveness but otherwise didn't find it too good. Maybe it's just a complicated subject, but in my opinion things were not explained very well. It sometimes seemed like the authors liked to spew out smart-sounding things rather than explain the topic at hand. To paraphrase Einstein "if you can't explain something simply, you don't know it well enough".

[Pawan · Rating 4 out of 5]

A book which I refhttp://www.goodreads.com/search/searc... again and again.

[Darth_alakazam]

wtf...

[Staffan Lundström · Rating 2 out of 5]

Better than "Data Structures and Algorithms in Java".