As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen et al book is the best textbook that I have ever seen on this subject. It offers an incisive, encyclopedic, and modern treatment of algorithms, and our department will continue to use it for teaching at both the graduate and undergraduate levels, as well as a reliable research reference.(Gabriel Robins, Department of Computer Science, University of Virginia)
Introduction to Algorithms, the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance.(Daniel Spielman, Department of Computer Science, Yale University)
Good quality and looks very new, although some dirt on the cover but it is cleanablePublished 4 months ago by E.E
The book is a classic example of computer science cult much like K&R. It is not a beginner friendly textbookPublished 4 months ago by mr-fool
explicit teaching and nice exercises. well... needless to say, this book has already had its good reputation. Read morePublished 15 months ago by Pengyu Zhao
Similar to what other people have said about this book, it's a great reference which does an excellent job covering the subject of algorithms in computer science. Read morePublished 20 months ago by Pat
Great packaging and fast shipping.
As a masters student, I still see this book to be ambiguous and not clear.