Introduction To Algorithms 1ST Edition

Includes bibliographcal references (p. [987]-996) and index.

Growth of functions — Summations — Recurrences — Sets, etc. — Counting and probability — Heapsort — Quicksort — Sorting in linear time — Medians and order statistics — Elementary data structures — Hash tables — Binary search trees — Red-black trees — Augmenting data structures — Dynamic programming — Greedy algorithms — Amortized analysis — B-trees — Binomial heaps — Fibonacci heaps — Data structures for disjoint sets — Elementary graph algorithms — Minimum spanning trees — Single-source shortest paths — All-pairs shortest paths — Maximum flow — Sorting networks — Arithmetic circuits — Algorithms for parallel computers — Matrix operations — Polynomials and the FFT — Number-theoretic algorithms — String matching — Computational geometry — NP-completeness — Approximation algorithms.