Introduction to algorithms / Thomas H. Cormen [and others].

Other author Cormen, Thomas H.
Format Electronic
Edition3rd ed.
Publication InfoCambridge, Mass. : MIT Press, ©2009.
Description1 online resource (xix, 1,292 pages) : illustrations
Supplemental ContentEBSCOhost
Subjects
Computer programming.
Computer algorithms.

Contents 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 noteIncludes bibliographical references and index.
Source of descriptionDescription based on print version record.
Issued in other formPrint version: Introduction to algorithms. 3rd ed. Cambridge, Mass. : MIT Press, c2009 9780262033848
Genre/formElectronic books.
LCCN 2009008593
ISBN9780262270830 (electronic bk.)
ISBN0262270838 (electronic bk.)
ISBN9781628709131 (electronic bk.)
ISBN1628709138 (electronic bk.)

Availability

Library Location Call Number Status Item Actions
Electronic Resources Access Content Online ✔ Available