Introduction To Algorithms

Portada
The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers.

There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms 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 readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
 

Comentarios de la gente - Escribir un comentario

Calificaciones de los usuarios

5 estrellas
144
4 estrellas
31
3 estrellas
6
2 estrellas
5
1 estrella
2

LibraryThing Review

Crítica de los usuarios  - IvanIdris - LibraryThing

This book is like an encyclopedia of algorithms. The algorithms are presented with pseudo code so it doesn’t matter what your favorite programming language is. A very rigorous mathematical approach is used for the analysis of for instance performance. Leer comentario completo

Crítica de los usuarios - Marcar como inadecuado

It is a fantastic book for those, who want to learn algorithms from scratch. This book consist a good explanation of all data structures which are fundamental and are also very important to understand to get a fruitful idea about algorithms.

Los 10 comentarios »

Contenido

Introduction
3
Getting Started 75
15
Growth of Functions
41
Recurrences
62
Probabilistic Analysis and Randomized Algorithms
91
Introduction 797
197
Hash Tables
221
Augmenting Data Structures
302
Minimum Spanning Trees
561
SingleSource Shortest Paths
580
Maximum Flow
643
Introduction
701
Matrix Operations
725
Linear Programming
770
Polynomials and the FFT 522
822
NumberTheoretic Algorithms
849

Introduction
321
Greedy Algorithms
370
Introduction
431
Binomial Heaps
455
Fibonacci Heaps
476
Data Structures for Disjoint Sets
498
Introduction
525
NPCompleteness
966
Introduction 7057
1057
B Sets Etc 7070
1070
Counting and Probability
1094
Bibliography
1127
Index 7745
1145
Derechos de autor

Otras ediciones - Ver todas

Términos y frases comunes

Acerca del autor (2001)

Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College. Cormen is one of the authors of Introduction to Algorithms.

Información bibliográfica