Introduction To Algorithms

Front Cover
Thomas H Cormen
MIT Press, 2001 - Computers - 1180 pages
212 Reviews
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

User ratings

5 stars
152
4 stars
42
3 stars
11
2 stars
5
1 star
2

Nice introduction and reference of the fundamentals. - Goodreads
Top of the line reference text. - Goodreads
I consider this book to be an essential reference. - Goodreads

Review: Introduction to Algorithms

User Review  - Zachariah - Goodreads

Nice introduction and reference of the fundamentals. I've used for class, for interview practice, and for personal projects. Read full review

Review: Introduction to Algorithms

User Review  - Arif - Goodreads

Well, technically I didn't finish reading all the chapters in the book, but at least I've read most of it. The topics in the book is well explained with concise example. But sometimes, I need to find ... Read full review

All 10 reviews »

Related books

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
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

Introduction
321
Greedy Algorithms
370
Introduction
431
Binomial Heaps
455
Fibonacci Heaps
476
Data Structures for Disjoint Sets
498
Introduction
525
NPCompleteness
966
Introduction 7057
1057
B Sets Etc 7070
1070
Counting and Probability
1094
Bibliography
1127
Index 7745
1145
Copyright

Common terms and phrases

References to this book

All Book Search results »

References from web pages

Introduction to Algorithms, Second Edition
In all international markets outside the USA and Canada: Introduction to Algorithms, Second Edition, is published by The MIT Press and is available in both ...
mitpress.mit.edu/ algorithms/

Introduction to Algorithms - Wikipedia, the free encyclopedia
Introduction to Algorithms is a book by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. It is used as the textbook for ...
en.wikipedia.org/ wiki/ Introduction_to_Algorithms

Introduction to Algorithms
Introduction to Algorithms, 2/e. Thomas H. Cormen, Dartmouth College Charles E. Leiserson, Massachusetts Institute of Technology ...
www.introductiontoalgorithms.com/

Crack The Interview • View forum - Introduction to Algorithms ...
Introduction to Algorithms By Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. Forum: Topics: Posts: Last post ...
cracktheinterview.in/ viewforum.php?f=103

Pythonic Introduction to Algorithms –
Hello and welcome to Pythonic Introduction to Algorithms! The purpose of this blog is teach me deeper algorithm magic and hopefully work as a useful ...
kapsi.fi/ ars/ pita/

Introduction to Algorithms | Book Preface
Introduction to Algorithms, 2/e. Thomas H. Cormen, Dartmouth College Charles E. Leiserson, Massachusetts Institute of Technology ...
highered.mcgraw-hill.com/ sites/ 0070131511/ information_center_view0/ book_preface.html

CS430 - Introduction to Algorithms Last Updated - 03/01/02 Course ...
Cormen, Leiserson and Rivest, Introduction to Algorithms, MIT Press/mcgraw Hill. References - other textbooks or materials ...
www.cs.iit.edu/ courses/ cs430.pdf

Introduction to algorithms by Thomas H. Cormen | librarything
All about Introduction to algorithms by Thomas H. Cormen. librarything is a cataloging and social networking site for booklovers.
www.librarything.com/ work/ 13005

csc 445: Introduction to Algorithms
Introduction to Algorithms, Second Edition MIT Press, Boston, 2001. (Note that used copies of CLRS can be bought for as little as $12 online, eg, ...
www.cs.arizona.edu/ classes/ cs445/ spring08/

Citations: Introduction to algorithms - Cormen, Leiserson, Rivest ...
TH Cormen, CE Leiserson, and RL Rivest. Introduction to algorithms. MIT Press and mcgraw-Hill Book Company, 6th edition, 1992.
bizseer.ist.psu.edu/ context/ 18265/ 0

About the author (2001)

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