Cover Image

Introduction to algorithms /

Show other versions (4)
Bibliographic Details
Main Author: Cormen, Thomas H.
Other Authors: Leiserson, Charles Eric, Rivest, Ronald L.
Format: Book
Language:English
Published: Cambridge, Mass. : New York : MIT Press ; McGraw-Hill, [1990]
Series:MIT electrical engineering and computer science series.
Subjects:
Computer programming.
Computer algorithms.
Table of Contents:
  • Growth of functions
  • Summations
  • Recurrences
  • Sets, etc.
  • Counting and probability
  • 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
  • Arithmetic circuits
  • Algorithms for parallel computers
  • Matrix operations
  • Polynomials and the FFT
  • Number-theoretic algorithms
  • String matching
  • Computational geometry
  • NP-completeness
  • Approximation algorithms.