Introduction To Algorithms
Thomas H Cormen
MIT Press, 2001 - Computers - 1180 pages
The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers.
There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms 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 the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
What people are saying - Write a review
Review: Introduction to AlgorithmsUser Review - Neda Bagheri - Goodreads
This book was our Reference book for Algorithm course in college. it was easy to read and for the covered materials look at the Bibliography. it covers the main subjects. Read full review
Review: Introduction to AlgorithmsUser Review - Cong - Goodreads
The organization is awesome. The pseudo code is very helpful. The problem is the formal style of writing. It would be much better if the author can hide the formal forms of proof in the appendix and ... Read full review
Getting Started 75
Growth of Functions
Probabilistic Analysis and Randomized Algorithms
Augmenting Data Structures
Minimum Spanning Trees
SingleSource Shortest Paths
Polynomials and the FFT 522