No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
To get the free app, enter your e-mail address or mobile phone number.
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)
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009).
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.
Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.
Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.
Very helpful book. Enjoy reading it together with Sedgewick's Algorihtms.Published 25 days ago by Dongxu Li
Good quality and looks very new, although some dirt on the cover but it is cleanablePublished 12 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 13 months ago by mr-fool
People have called this the best book for algorithms. If you want to learn about algorithms and have no prior knowledge, this is what you want to read!Published 20 months ago by Diana
Nothing too much to talk about this book. It is so authoritative, rigorous and comprehensive. Every ITer needs this book at your desk for reference or studying, at anytime.Published 23 months ago by Zheng Zeng