You are here

Introduction to Algorithms

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
Publisher: 
MIT Press
Publication Date: 
2001
Number of Pages: 
1184
Format: 
Hardcover
Edition: 
2
Price: 
82.00
ISBN: 
978-0262032933
Category: 
Textbook
We do not plan to review this book.

Preface
Download Chapter as PDF Sample Chapter - Download PDF (28 KB)
xiii
I Foundations
Introduction 3
1 The Role of Algorithms in Computing
Download Chapter as PDF Sample Chapter - Download PDF (103 KB)
5
2 Getting Started 15
3 Growth of Functions 41
4 Recurrences 62
5 Probabilistic Analysis and Randomized Algorithms 91
II Sorting and Order Statistics
Introduction 123
6 Heapsort 127
7 Quicksort 145
8 Sorting in Linear Time 165
9 Medians and Order Statistics 183
III Data Structures
Introduction 197
10 Elementary Data Structures 200
11 Hash Tables 221
12 Binary Search Trees 253
13 Red-Black Trees 273
14 Augmenting Data Structures 302
IV Advanced Design and Analysis Techniques
Introduction 321
15 Dynamic Programming 323
16 Greedy Algorithms 370
17 Amortized Analysis 405
V Advanced Data Structures
Introduction 431
18 B-Trees 434
19 Binomial Heaps 455
20 Fibonacci Heaps 476
21 Data Structures for Disjoint Sets 498
VI Graph Algorithms
Introduction 525
22 Elementary Graph Algorithms 527
23 Minimum Spanning Trees 561
24 Single-Source Shortest Paths 580
25 All-Pairs Shortest Paths 620
26 Maximum Flow 643
VII Selected Topics
Introduction 701
27 Sorting Networks 704
28 Matrix Operations 725
29 Linear Programming 770
30 Polynomials and the FFT 822
31 Number-Theoretic Algorithms 849
32 String Matching 906
33 Computational Geometry 933
34 NP-Completeness 966
35 Approximation Algorithms 1022
VIII Appendix: Mathematical Background
Introduction 1057
A Summations 1058
B Sets, Etc. 1070
C Counting and Probability 1094

Bibliography
Download Chapter as PDF Sample Chapter - Download PDF (135 KB)
1127
Index
Download Chapter as PDF Sample Chapter - Download PDF (223 KB)
11
Tags: 

Dummy View - NOT TO BE DELETED