 |
GetTextbooks.co.uk
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Computer Algorithms: Introduction to Design and Analysis (Addison-Wesley Series in Computer Science) by Sara Baase ISBN-10: 9780201060355 ISBN-10: 0-201-06035-3 ISBN-13: 9780201060355 ISBN-13: 978-0-201-06035-5 Hardcover 1988-02 Addison-Wesley Find Lowest Price |
Editorials | ||
Book Description Drawing upon combined decades of teaching experience, Professors Sara Baase and Allen Van Gelder have extensively revised this best seller on algorithm design and analysis to make it the most current and accessible book available. This edition features an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms, along with the addition of new topics and exercises. It continues the tradition of solid mathematical analysis and clear writing style that made it so popular in previous editions. | ||
Reviews | ||
poorly executed text This textbook is a mess. It is not elegant or clear, and their coverage of certain topics is confusing and deviates from standard practice. If your algorithms class is using this text, find some friends to pool together and get a copy for the exercises if they are used, otherwise take the book from MIT by Rivest et al out of the library and read that. Introduction to Algorithms | ||
Worst book I ever read I would have rated "0 stars " if poosible in the selection. Since this is the textbook for my course I have to deal with this book. The way things are mentioned in this book I doubt whether the authors have even understood the concepts right. I think that the authors themselves are confused while writing this book. If this book is for your course, drop the course before it is too late. | ||
Is really this book so Terrible? if so,it's very pity ,because it is the textbook of my Algorithm class this term. | ||
This is not the Algorithms book you are looking for. Move along. This book is in a word, bad. The explanations of the algorithms are decent in places but in some areas using the pseudo code provided you could not reproduce a working algorithm. What data structure they are using is sometimes difficult to determine. They also use function calls they do not explain. When reading the book they are constantly referring back to things they talked about chapters ago just by giving an "Algorithm" or figure number. But with the Lemma and definitions and Examples having similar numbers you will spend a lot of time looking for it, how hard would a page number be? Over all I am not happy. On the plus side the math review at the start of the book is decent and the book is not too wordy. I have 4 books on algorithms and I still have not found one that I really like, a shame. This book attempts to be a modern update to "The Design and Analysis of Computer Algorithms" -AHO | Hopcroft | Ullman. An update of that book is not what students need. They need a rethinking of how to present algorithms. We are still waiting on that book. | ||
Is this the worst comp sci book at Amazon ? An appalling book. Boring, poorly written, poorly edited. Try Algorithm design manual by Steven S. Skiena or Thomas H. Cormen's Introduction to Algorithms or Kleinberg and Tardos' Algorithm Design or the excellent Introduction to the Design and Analysis of Algorithms by Anany V. Levitin instead of this mish-mash. | ||