Introduction to Algorithms

by Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.

• ISBN13: 9780262031417
• ISBN10: 0262031418
• Format: Hardcover
• Copyright: 1990-07-01
• Publisher: Mit Pr

Summary

This edition is no longer available. Please see the Second Edition of this title.

Table of Contents

Preface	p. xiii
Foundations
Introduction	p. 3
The Role of Algorithms in Computing	p. 5
Getting Started	p. 15
Growth of Functions	p. 41
Recurrences	p. 62
Probabilistic Analysis and Randomized Algorithms	p. 91
Sorting and Order Statistics
Introduction	p. 123
Heapsort	p. 127
Quicksort	p. 145
Sorting in Linear Time	p. 165
Medians and Order Statistics	p. 183
Data Structures
Introduction	p. 197
Elementary Data Structures	p. 200
Hash Tables	p. 221
Binary Search Trees	p. 253
Red-Black Trees	p. 273
Augmenting Data Structures	p. 302
Advanced Design and Analysis Techniques
Introduction	p. 321
Dynamic Programming	p. 323
Greedy Algorithms	p. 370
Amortized Analysis	p. 405
Advanced Data Structures
Introduction	p. 431
B-Trees	p. 434
Binomial Heaps	p. 455
Fibonacci Heaps	p. 476
Data Structures for Disjoint Sets	p. 498
Graph Algorithms
Introduction	p. 525
Elementary Graph Algorithms	p. 527
Minimum Spanning Trees	p. 561
Single-Source Shortest Paths	p. 580
All-Pairs Shortest Paths	p. 620
Maximum Flow	p. 643
Selected Topics
Introduction	p. 701
Sorting Networks	p. 704
Matrix Operations	p. 725
Linear Programming	p. 770
Polynomials and the FFT	p. 822
Number-Theoretic Algorithms	p. 849
String Matching	p. 906
Computational Geometry	p. 933
NP-Completeness	p. 966
Approximation Algorithms	p. 1022
Appendix: Mathematical Background
Introduction	p. 1057
Summations	p. 1058
Sets, Etc.	p. 1070
Counting and Probability	p. 1094
Bibliography	p. 1127
Index	p. 1145
Table of Contents provided by Publisher. All Rights Reserved.