Product Description
Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.
Data Structures and Algorithms in Java by Adam Drozdek (2001, Book, Illustrated) | US $14.95 End Date: Thursday May-24-2012 11:44:31 PDT Buy It Now for only: US $14.95 Buy it now | Add to watch list |
I purchased it new directly from Amazon but there’s no shrink wrap film on the book and both the front cover and the back cover have some scratches by certain shart utils and also kind of stained. And the mail arrived in a large bubble envelope… I remember every time I purchased a new book from Amazon before, it always arrived with a paper box with air cushion. And the supposed new condition is why I’d pay some extra tens of dollars instead of buying a used book. I even suspected for a while that I ordered a “used, but acceptable” one. I thought of mail it back, but the course has begun, and I cannot go along without a textbook…
Amazon User Rating: 2 / 5
This book is not concise; also the pseudocode syntax used in the book is annoying.
If you enjoy reading for the sake of reading then you might enjoy this book.There are better books out there by Knuth, Corman and Aho that cover the same topics as this one.
Amazon User Rating: 3 / 5
The price of this book is reasonable,
and
I got this book in five days after ordering.
The condition of this book is as description.
Amazon User Rating: 5 / 5
This is a great book for an undergraduate level introduction to design and analysis of algorithms. It has been used as the textbook for the undergrad intro to algorithms course at Cornell University for the last 3 years, and I have personally used this book as both a student and a TA. It covers a broad range of topics and gives tons of examples for each topic. This is especially helpful for topics like NP-completeness, where the problems are like the animals in a zoo, they come in all sorts of varieties and it’s not obvious how they relate to each other. The beginning student needs a lot of examples and practice to learn the techniques of constructing reductions and proving their correctness.
Of course, this book isn’t perfect. Students still do come to my office hours to chat and stuff.
Amazon User Rating: 5 / 5
This is a great text as it teaches you the major techniques for designing efficient algortihms and how to solve real-life problems using algorithms rather than just presenting polished but inscrutable solutions to abstract problems
Amazon User Rating: 5 / 5