Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.
Material type: TextPublisher: New Delhi : PHI Learning Private Ltd., 2019Edition: Third edition, Eastern economy editionDescription: xix, 1292 pages: illustrations ; 24 cmContent type:- text
- unmediated
- volume
- 9788120340077
- 005.1 CO.I 2019 23
- QA76.6 .C662 2009
- 54.10
Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
Books | The Knowledge Hub Library | Computing | 005.1 CO.I 2019 (Browse shelf(Opens below)) | Available | 190344 | ||
Books | The Knowledge Hub Library | Computing | 005.1 CO.I 2019 (Browse shelf(Opens below)) | Available | 190345 |
Reprinted in India by special arrangement with MIT Press. Original edition published by the MIT Press, Cambridge. MA.
Includes bibliographical references (pages 1231-1249) and index.
I. Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- Probabilistic analysis and randomized algorithms -- II. Sorting and order statistics. Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- III. Data structures. Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV. Advanced design and analysis techniques. Dynamic programming -- Greedy algorithms -- Amortized analysis -- V. Advanced data structures. B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI. Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximun flow -- VII. Selected topics. Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms -- VIII. Appendix: Mathematical background. Summations -- Sets, etc. -- Counting and probability -- Matrices -- Bibliography -- Index.
This third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and a substantial additions to the chapter on recurrences (now called "Divide-and-Conquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks--Page 4 of cover.
There are no comments on this title.