Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
Material type: TextPublisher: Cambridge, Massachusetts : The MIT Press, 2009Edition: Third editionDescription: xix, 1292 pages : illustrations ; 24 cmContent type:- text
- unmediated
- volume
- 9780262033848
- 0262033844
- 9780262533058
- 0262533057
- 005.1 CO. I 2009 22
- QA76.6 .C662 2009
- 54.10
Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
Books | The Knowledge Hub Library | Engineering | 005.1 CO.I 2009 (Browse shelf(Opens below)) | Available | 210000 | ||
Books | The Knowledge Hub Library | Engineering | 005.1 CO.I 2009 (Browse shelf(Opens below)) | Available | 210001 | ||
Books | The Knowledge Hub Library | Engineering | 005.1 CO.I 2009 (Browse shelf(Opens below)) | Available | 210002 | ||
Books | The Knowledge Hub Library | Engineering | 005.1 CO.I 2009 (Browse shelf(Opens below)) | Available | 210003 | ||
Books | The Knowledge Hub Library | Engineering | 005.1 CO.I 2009 (Browse shelf(Opens below)) | Available | 210004 | ||
Books | The Knowledge Hub Library | Engineering | 005.1 CO.I 2009 (Browse shelf(Opens below)) | Available | 210005 |
Includes bibliographical references (pages 1231-1250) and index.
Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- Probabilistic analysis and randomized algorithms -- I. Sorting and order statistics. Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- II. Data structures. Elementary data structures -- Hash tables --Binary search trees -- Red-black trees -- Augmenting data structures -- Advanced design and analysis techniques. Dynamic programming -- Greedy algorithms -- Amortized analysis -- Advanced data structures. B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- $t Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- 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.
This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.--[book cover].
There are no comments on this title.