Introduction to Algorithms, 3rd Edition

Front Cover
MIT Press, Jul 31, 2009 - Computers - 1312 pages
58 Reviews

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 new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press.

What people are saying - Write a review

User ratings

5 stars
24
4 stars
26
3 stars
7
2 stars
1
1 star
0

Nice introduction and reference of the fundamentals. - Goodreads
The problem is the formal style of writing. - Goodreads
Nicely written, no bullshit, just pure explanations. - Goodreads
Top of the line reference text. - Goodreads
I consider this book to be an essential reference. - Goodreads
As the title says its just an intro .... - Goodreads

Review: Introduction to Algorithms

User Review  - Kaung Htet Zaw - Goodreads

One of the best algorithm textbooks out there. Always my go-to book for algorithm reference. Read full review

Review: Introduction to Algorithms

User Review  - Jeff Rogers - Goodreads

Good reference Read full review

All 54 reviews »

About the author (2009)

Thomas H. Cormen is the co-author of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein. He has a new book out called Algorithms Unlocked. He is a Full Professor of computer science at Dartmouth College and currently Chair of the Dartmouth College Department of Computer Science. Between 2004 and 2008 he directed the Dartmouth College Writing Program.[2] His research interests are algorithm engineering, parallel computing, speeding up computations with high latency.

Bibliographic information