Introduction to Algorithms, third edition

Thomas H. Cormen · Charles E. Leiserson · Ronald L. Rivest · Clifford Stein

Jul 2009 · MIT Press

About this ebook

The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.

Ratings and reviews

Excellent book for beginners to learn how to build the logic and approach to solve the problem. Exercise mentioned at end of chapters are really good to grasp all concepts. One thing I felt a little difficult for me was, to understand certain parts you require strong mathematics. Overall very nice book.

This book's page numbers are off. Google's page one is the book's page 146. The book's page one is Google's page xxii. Google Support says this is how the book was delivered to them by the publisher. Because of the discrepancy in page numbers, the first five chapters of the book cannot be searched. Page numbers for reading, given to me by my instructor, have to be found manually. If you need this book for a class, avoid it here.

Amazing and great Algorithms book for CS. However, here quality of text is very bad. Text is blur and not clear at all. Specially in browser this book look very bad. Text image quality of the book need to be improved, seriously. Text is BLUR!!

About the author

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.