Introduction to algorithms /

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of reader...

Descripción completa

Detalles Bibliográficos
Clasificación:QA76.6 I5.67 2009
Otros Autores: Cormen, Thomas H. (coaut)
Formato: Libro
Idioma:Inglés
Publicado: Cambridge, Massachusetts : MIT Press, 2009.
Edición:3rd ed.
Temas:
Computer programming
Computadoras > Programación
Computer algorithms
Algoritmos computacionales
Tabla de Contenidos:
  • 1. 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.

Ejemplares similares