Algorithm Design - Foundations, Analysis & Internet Examples

ISBN:0471383651
Pages:720
Date:2001-09-15
Publisher:Wiley
Rating:5.0

Read Algorithm Design - Foundations, Analysis & Internet Examples Online
1. Online Book Mirror [algorithmdesign.net]

    Book Description
Michael Goodrich and Roberto Tamassia, authors of the successful, Data Structures and Algorithms in Java, 2/e, have written Algorithm Engineering, a text designed to provide a comprehensive introduction to the design, implementation and analysis of computer algorithms and data structures from a modern perspective. This book offers theoretical analysis techniques as well as algorithmic design patterns and experimental methods for the engineering of algorithms. Market: Computer Scientists; Programmers./p>
Reviews From AMAZON.COM
An excellent textbook
After researching a variety of alternatives, I settled upon using Algorithm Design by Goodrich and Tamassia to teach a junior-level algorithms course and the experience has been quite positive. While instructor material grows a bit sparse in the last half or third of the book, it's still quite useful. The slides are great and many of the problems have solutions available. Moreover, the solutions tend to be correct (I've only found two mistakes, which may be covered in the up-to-date errata).The layout of the sections and chapters is quite natural and easy to adapt to your own course, although the last third of the book is essentially an assortment of topics that didn't fit in anywhere else. I would advise bringing some of those topics in to the course early on as diversions from the main material, which admittedly can get a little dry.For the most part, the book is well written with interesting and adequete end of chapter problems. There are relatively few Java-based examples, but we skipped over them anyhow -- the pseudo-code is quite acceptable. Goodrich and Tamassia give a broad survey of topics, but cover them in enough depth and with enough rigor for an undergraduate course where CLR(S) would be overkill. I recommend it.
A good introduction text to algorithms
I would not consider this book as the ultimate book for algorithms as the title suggests. :-) However, it is a very readable book, and filled with brief, but concise observations. Do not get me wrong. This book also has very detailed explanations of fundamental data structures and algorithms. Also, the best part of the book is that it lists good references for further readings. I loved this book. I would suggest this book to others. Math hints at the back of the books are useful, and some excercises are quite brain challenging. I think it is a great practice for students, but it is not so fun when students get it for assignments. :-)