Skip to content

Introduction to Algorithms

Spend $50 to get a free DVD!

ISBN-10: 0262032937

ISBN-13: 9780262032933

Edition: 2nd 2001

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

List price: $85.00
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithmscombines 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.
Customers also bought

Book details

List price: $85.00
Edition: 2nd
Copyright year: 2001
Publisher: MIT Press
Publication date: 9/1/2001
Binding: Hardcover
Pages: 1202
Size: 8.25" wide x 9.00" long x 2.25" tall
Weight: 4.598
Language: English

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.

Preface
Foundations
Introduction
The Role of Algorithms in Computing
Getting Started
Growth of Functions
Recurrences
Probabilistic Analysis and Randomized Algorithms
Sorting and Order Statistics
Introduction
Heapsort
Quicksort
Sorting in Linear Time
Medians and Order Statistics
Data Structures
Introduction
Elementary Data Structures
Hash Tables
Binary Search Trees
Red-Black Trees
Augmenting Data Structures
Advanced Design and Analysis Techniques
Introduction
Dynamic Programming
Greedy Algorithms
Amortized Analysis
Advanced Data Structures
Introduction
B-Trees
Binomial Heaps
Fibonacci Heaps
Data Structures for Disjoint Sets
Graph Algorithms
Introduction
Elementary Graph Algorithms
Minimum Spanning Trees
Single-Source Shortest Paths
All-Pairs Shortest Paths
Maximum Flow
Selected Topics
Introduction
Sorting Networks
Matrix Operations
Linear Programming
Polynomials and the FFT
Number-Theoretic Algorithms
String Matching
Computational Geometry
NP-Completeness
Approximation Algorithms
Appendix: Mathematical Background
Introduction
Summations
Sets, Etc.
Counting and Probability
Bibliography
Index