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

Review: Introduction to Algorithms

User Review - Goodreads

What a terrible book. Though it's the cornerstone of many CS undergrad algorithm courses, this book fails in every way. In almost every way, Dasgupta and Papadimitriou's "Algorithms" is a much better ...

Review: Introduction to Algorithms

User Review  - Harry Yeh - Goodreads

Good book to read if you are interested in learning some good computer algorithms or are new to the algorithm space. I read this book when I was doing my computer science course at Stanford and it ...

Contents

• Introduction: 3
• Getting Started 75: 15
• Growth of Functions: 41
• Recurrences: 62
• Probabilistic Analysis and Randomized Algorithms: 91
• Introduction 797: 197
• Hash Tables: 221
• Augmenting Data Structures: 302
• Introduction: 321
• Greedy Algorithms: 370
• Introduction: 431
• Binomial Heaps: 455
• Fibonacci Heaps: 476
• Data Structures for Disjoint Sets: 498
• Introduction: 525
• Minimum Spanning Trees: 561
• SingleSource Shortest Paths: 580
• Maximum Flow: 643
• Introduction: 701
• Matrix Operations: 725
• Linear Programming: 770
• Polynomials and the FFT 522: 822
• NumberTheoretic Algorithms: 849
• NPCompleteness: 966
• Introduction 7057: 1057
• B Sets Etc 7070: 1070
• Counting and Probability: 1094
• Bibliography: 1127
• Index 7745: 1145

About the author

Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College. Cormen is one of the authors of Introduction to Algorithms.

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.

Bibliographic information

• Title: Introduction To Algorithms
• Editor: Thomas H Cormen
• Contributors: Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein
• Edition: 2, illustrated, reprint
• Publisher: MIT Press, 2001
• ISBN: 0262032937, 9780262032933
• Length: 1180 pages
• Subjects: Computers / Computer Science