Normal view MARC view ISBD view

Introduction to algorithms / Algorithms Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein - 2nd ed. - New Delhi : Prentice-Hall of India Private Limited, c2001. - xxi, 1180 p. ; 25 cm.

Rev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.

Includes bibliographical references (p. [1127]-1130) and index.

The role of algorithms in computing --
Getting started --
Growth of functions --
Recurrences --
Probabilistic analysis and randomized algortihms --
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 --
Matrix operations--
Linear programming --
Polynomials and the FFT --
Number-theoretic algortihsm --
String matching--
Computational geometry --
NP-completeness --
approximation algorithms --
A. summations --
B. Sets, etc. --
C. Counting and probability. TOC



ISBN: 0262032937 8120321413 0262531968 0262032937 9780262032933 9788120321410

LCCN: 2001031277

Subjects--Topical Terms:
Computer programming.
Computer algorithms.

LC Class. No.: QA76.6 / .I5858 2001

Dewey Class. No.: 005.1 / INT 2001