Rating: 
Summary: The best algorithm book in the world!
Review: A very good book! Doesn't go into the material too deeply, but is a great thing for all students who want to learn interesting algorithms from any part of informatics.
Rating: 
Summary: Code is translated from Pascal
Review: Bob once admitted that almost all the code is translated from Pascal. He does not have time to write the same code for various editions of his books and uses translator software...
Rating:
Summary: Greatest Book Known to Man!
Review: Comes in handy for tests at school and great resource for programming issues concerning sorts and searches!
Rating:
Summary: A Classic!
Review: Concise and detailed, the only other book( or books) comparable to this may well be the venerable "The Art of Computer Programming" series by Donald Knuth. Comprising a wide range of algorithms, it have served me well as a 'quick and dirty' reference. A definite must-have for the avid programmer
Rating: 
Summary: This is a GREAT algorithms book for intermediate level...
Review: Finally a book that just cuts to the chase and gives you the building blocks for basic and advanced data structures and methods. The chapters are well written so that you won't feel too tired after reading one, and the code is pretty concise and readable. The book begins with elementary algorithms and data structures that should be under every programmer's belt before moving on to the good stuff: hash tables, graphs, n log(n) sorting algorithms, Red-Black trees, and really cool heap array implementations. If that wasn't enough for you, the book moves on to upper level undergrad type algorithms that will be useful in the future. I thought the chapter on Hash Tables was well written and easy to implement. Also, the chapter on Graphs was easy to understand with their pictures of various "trees" or "forests" that could form with nodes. I'd highly recommend reading the hash table chapter with the hash function "hashpjw" from the "Dragon Book."
Rating: 
Summary: Ugly and Obtusely written examples and text.
Review: For being one of the top computer gurus, this person sure writes some ugly code. Many if not most of the code samples are broken. Also he uses cryptic variable names (a, b, c, x...) and bad coding form in general (most variables are global). This would be fine if this was not a text for Learning algorithms. (looks like the example code was run through a Fortran to Pascal to C converter) On the other hand, I found many of the illustrations very helpful in figuring out what he was trying to say with text. If this book was not required for my class I would not have bought it. I found Numerical Recipes in C to be more useful.
Rating: 
Summary: A struggle to read...
Review: I agree strongly with the previous reviewer, I found this book very difficult to read and wonder who it would be suitable for. I found the examples weak and the quality of C++ surprising. This book is certainly not for the beginner, nor is it for the professional who needs answers yesterday. It does cover a lot of ground though, so perhaps it could be useful as a backup text.
Rating:
Summary: not as good as pascal version
Review: I bought "Algorithms" by the same author (the pascal version) and it was one of the most absorbing textbooks I have read; great book. I didn't even need to take the course. :-) The diagrams and the visualization of sorting methods were especially helpful.I can't recommend the C version very highly though.. I only skimmed parts of it, but managed to find quite a few errors in the examples. Be sure to check out the errata on the author's web page. I'll stick with the pascal version.. I don't necessarily need runnable code to understand the algorithm anyway.
Rating:
Summary: to difficult to understand
Review: i feel writer is confused and writes very jumbled together spaghetti code.
to tough to uderstand
horrible reference book
Rating:
Summary: Classic text, but those looking for OOP may be disapointed
Review: I first read Sedgewick's Algorithms many years ago for a programming class in college. I was impressed at the time by it's clear presentation and thorough handling of the most fundamental data structures and algorithms. Queues, hash tables, various flavors of trees and graphs... it's all explained quite well in the text. The orginal edition had code examples in Pascal, and when I lost that copy, I decided to get the 'C++' version. The content is basically identical -- which is not necessarily a bad thing. Those looking for modern object-oriented code examples, however, will be dissapointed. Only the most minimal effort has been made to go from the original Pascal listings. It is really a matter of expectations. The code is not the most readable (many single letter variable names), but the true value of this book is the text, not the code.
| 
