|
|
Message from Dean - May 8th 2007
I am currently testing out a new version of the APF Bridge Component - If you notice any errors within this demo store please drop me a line.
List Price: $95.00Amazon.com's Price: $67.02 You Save: $27.98 (29%)Prices subject to change.
Availability: Usually ships in 24 hours
This item ships for FREE with Super Saver Shipping.
Binding: Paperback
Dewey Decimal Number: 519.7
EAN: 9780201612448
Edition: 3
ISBN: 0201612445
Label: Addison Wesley
Manufacturer: Addison Wesley
Number Of Items: 1
Number Of Pages: 688
Publication Date: November 15, 1999
Publisher: Addison Wesley
Studio: Addison Wesley
Alternate Versions: Click to Display
Related Items:
Browse for similar items by category:
Editorial Review:
Product 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.
Average Rating: 
Rating:  -
I had to buy this because my instructor wrote this book and homework assignments were from the book.
The whole book is designed very poorly and I remember having to flip back and forth just to read it straight forward. Let me clarify. As an example, I would be reading a paragraph that refers to page C, so I would go to page C and that page C refers to page A, etc. It was just painful to try to understand what this.
Today (after 5 years later), I use this book as an example of how not to write a book.
Rating: -
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
Rating: -
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.
Rating: -
if so,it's very pity ,because it is the textbook of my Algorithm class this term.
Rating: -
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 ... Read More
Availability: Usually ships in 24 hours
|
Amazon Store 