Ship-Ship-Hooray! Free Shipping on $25+ Details >

Cover type: Hardback

Edition: 3RD 09

Copyright: 2009

Publisher: MIT Press

Published: 2009

International: No

Edition: 3RD 09

Copyright: 2009

Publisher: MIT Press

Published: 2009

International: No

List price: $99.00

All of our used books are 100% hand-inspected and guaranteed! Happy you, happy us.

FREE Shipping on $25+

Order $25 or more and the shipping's on us. Marketplace items and other exclusions apply.

Ships Today!

Order by noon CST (Mon-Fri, excluding holidays). Some restrictions apply.

Easy 30-Day Returns

Not the right book for you? We accept returns within 30 days of purchase. Access codes are non-refundable once revealed or redeemed.

Ships directly from us

You Save $40.40 (41%)

$58.60

Condition: Very Good
**100% Satisfaction Guarantee**

We hand-inspect every one of our used books.

We hand-inspect every one of our used books.

Only $29.30 after buyback!

• Sell back to us by:

Dec 31, 2018

Dec 31, 2018

• Guaranteed Cash Back:

$29.30

$29.30

• Your Cost After Buyback:

$29.30

$29.30

This title is currently not available in digital format.

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

Also available in the Marketplace starting at $52.99

Price | Condition | Seller | Comments |
---|

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, and substantial additions to the chapter on recurrences (now called "Divide-and-Conquer"). 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.

Thomas Cormen is Professor of Computer Science at Dartmouth College.

Charles Leiserson is Professor of Computer Science and Engineering at MIT. Ronald L.

Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at MIT. Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.

Table of Contents

Preface

I Foundations

1 The Role of Algorithms in Computing

2 Getting Started

3 Growth of Functions

4 Recurrences

5 Probabilistic Analysis and Randomized Algorithms

II Sorting and Order Statistics

6 Heapsort

7 Quicksort

8 Sorting in Linear Time

9 Medians and Order Statistics

III Data Structures

10 Elementary Data Structures

11 Hash Table

12 Binary Search Trees

13 Red-Black Trees

14 Augmenting Data Structures

IV Advanced Design and Analysis Techniques

15 Dynamic Programming

16 Greedy Algorithms

17 Amortized Analysis

V Advanced Data Structures

18 B-Trees

19 Binomial Heaps

20 Fibonacci Heaps

21 Data Structures for Disjoint Sets

VI Graph Algorithms

22 Elementary Graph Algorithms

23 Minimum Spanning Trees

24 Single-Source Shortest Paths

25 All-Pairs Shortest Paths

26 Maximum Flow

VII Selected Topics

27 Sorting Networks

28 Matrix Operations

29 Linear Programming

30 Polynomials and the FFT

31 Number-Theoretic Algorithms

32 String Matching

33 Computational Geometry

(and more...)

shop us with confidence

Summary

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, and substantial additions to the chapter on recurrences (now called "Divide-and-Conquer"). 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.

Author Bio

Thomas Cormen is Professor of Computer Science at Dartmouth College.

Charles Leiserson is Professor of Computer Science and Engineering at MIT. Ronald L.

Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at MIT. Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.

Table of Contents

Table of Contents

Preface

I Foundations

1 The Role of Algorithms in Computing

2 Getting Started

3 Growth of Functions

4 Recurrences

5 Probabilistic Analysis and Randomized Algorithms

II Sorting and Order Statistics

6 Heapsort

7 Quicksort

8 Sorting in Linear Time

9 Medians and Order Statistics

III Data Structures

10 Elementary Data Structures

11 Hash Table

12 Binary Search Trees

13 Red-Black Trees

14 Augmenting Data Structures

IV Advanced Design and Analysis Techniques

15 Dynamic Programming

16 Greedy Algorithms

17 Amortized Analysis

V Advanced Data Structures

18 B-Trees

19 Binomial Heaps

20 Fibonacci Heaps

21 Data Structures for Disjoint Sets

VI Graph Algorithms

22 Elementary Graph Algorithms

23 Minimum Spanning Trees

24 Single-Source Shortest Paths

25 All-Pairs Shortest Paths

26 Maximum Flow

VII Selected Topics

27 Sorting Networks

28 Matrix Operations

29 Linear Programming

30 Polynomials and the FFT

31 Number-Theoretic Algorithms

32 String Matching

33 Computational Geometry

(and more...)

Publisher Info

Publisher: MIT Press

Published: 2009

International: No

Published: 2009

International: No

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, and substantial additions to the chapter on recurrences (now called "Divide-and-Conquer"). 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.

Charles Leiserson is Professor of Computer Science and Engineering at MIT. Ronald L.

Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at MIT. Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.

Preface

I Foundations

1 The Role of Algorithms in Computing

2 Getting Started

3 Growth of Functions

4 Recurrences

5 Probabilistic Analysis and Randomized Algorithms

II Sorting and Order Statistics

6 Heapsort

7 Quicksort

8 Sorting in Linear Time

9 Medians and Order Statistics

III Data Structures

10 Elementary Data Structures

11 Hash Table

12 Binary Search Trees

13 Red-Black Trees

14 Augmenting Data Structures

IV Advanced Design and Analysis Techniques

15 Dynamic Programming

16 Greedy Algorithms

17 Amortized Analysis

V Advanced Data Structures

18 B-Trees

19 Binomial Heaps

20 Fibonacci Heaps

21 Data Structures for Disjoint Sets

VI Graph Algorithms

22 Elementary Graph Algorithms

23 Minimum Spanning Trees

24 Single-Source Shortest Paths

25 All-Pairs Shortest Paths

26 Maximum Flow

VII Selected Topics

27 Sorting Networks

28 Matrix Operations

29 Linear Programming

30 Polynomials and the FFT

31 Number-Theoretic Algorithms

32 String Matching

33 Computational Geometry

(and more...)