Introduction to Algorithms

Rating:
Summary: best book on algorithms
Review: this is possibly the best book for the course 'Data structures and analysis of algorithms'.Knuth is far too advanced and many others are not even worth mentioning.
The best part is that it is very perspicuous but does not compromise on mathematical rigour.The proofs of correctness are very elegant as are the detalied analyses of all the algorithms.Actually,the mathematical approach that the authors employ is very enjoyable.A full section devoted to the mathematical tools is a very good idea.
All the topics viz. data structures, sorting techniques,graphs,design techniques like dynamic programming,greedy algorithms,Divide-n-conquer r given in extensive detail.(since i m only a second yr under grad student,i havent read the more advanced topics like FFT,computational geometry,NP-completeness.)
The exercises make you think and test both mathematical acumen and programming dexterity.many of them require a fair bit of creativity.
As another reviewer pointed out, this book is the one for budding computer scientists and software engineers,not for the 'learn XYZ in 21 hours' fans.
a bit of background in a structured programming language(Pascal ,C etc.) and more importantly,knowledge of the fundamentals of discrete mathematics is required.
A must buy for all CS students.

Rating:
Summary: great reference, bad teacher
Review: This wouldn't be the book I'd choose for an introductory algorithms class; it's a bit dense at times. However, it's an excellent reference, one of the few textbooks i've kept and will make use of.

Rating:
Summary: It's a standard, but...
Review: While many have noted how Thomas Corwen and his co-authors have added a scholarly touch to this subject with plenty of proofs it does not make for a good text. One can argue that this book should supplement the instructor's teachings. That would be fine except for the fact that there are no answers to the problems. Therefore, a student has no idea if he or she is on the right track.
To this end Corwen snidely replies on his website that any student asking for the answer will have his or her name posted as a potential cheater since Corwen believes that instructors should be able to use his problems as homework. Here's an idea, how about instructors developing their own problems!
Corwen also does not relate the material in plain English as someone like Frank Carrano does. There are other sources of many of the concepts like binary search trees, sorting algorithms, O-notation. The only thing Corwen is adding is lots of proof and mathematical shorthand.
If you are interested in the mathematical concepts behind the algorithms this is a fine introduction. If you are interested in the algorithmic concepts, this is not for you. Ultimately if you are a student whose instructor will be using this book, you have no choice about buying it. If you are an instructor, however, look at another book to supplement your teachings.