Catalog

Record Details

Catalog Search



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

Cormen, Thomas H. (Added Author).
Image of item

Available copies

  • 1 of 1 copy available at Evergreen Indiana.

Current holds

0 current holds with 1 total copy.

Location Call Number / Copy Notes Barcode Shelving Location Status Due Date
Tyson Library - Versailles 005.122 COR (Text) 31070500426636 Adult Fiction Available -

Record details

  • ISBN: 9780262033848
  • ISBN: 0262033844
  • ISBN: 9780262533058
  • ISBN: 0262533057
  • Physical Description: xix, 1292 pages : illustrations ; 24 cm
  • Edition: 3rd ed.
  • Publisher: Cambridge, Mass. : MIT Press, ©2009.

Content descriptions

Bibliography, etc. Note: Includes bibliographical references (pages [1231]-1250) and index.
Formatted Contents Note: 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.
Summary, etc.: 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].
Subject: Computer programming
Computer algorithms

Additional Resources