Introduction To Algorithms

Cover
This title 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.
 

Inhalt

Introduction
3
Getting Started
15
Growth of Functions
41
Recurrences
62
Probabilistic Analysis and Randomized Algorithms
91
Introduction
123
Quicksort
145
Sorting in Linear Time
165
Data Structures for Disjoint Sets
498
22
525
23
561
27
701
30
822
String Matching
906
Computational Geometry
933
NPCompleteness
966

Medians and Order Statistics
183
Introduction
197
Hash Tables
221
Introduction
321
18
431
Binomial Heaps
455
Fibonacci Heaps
476
Approximation Algorithms
1022
B Sets Etc
1070
с Counting and Probability
1094
Bibliography
1127
Index
1145
Urheberrecht

Andere Ausgaben - Alle anzeigen

Häufige Begriffe und Wortgruppen

Autoren-Profil (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.

Bibliografische Informationen