Introduction to Algorithms
Autor :
Thomas H. Cormen,
Charles E. Leiserson,
Ronald L. Rivest
Idioma :
English
Fecha de publicación :
1998
Páginas :
1028
Edición :
21ª
Editorial :
MIT Press,
McGraw-Hill
Encuadernación :
Tapa Dura
Sinopsis :
This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers.
We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a "pseudocode" designed to be readable by anyone who has done a little programming.
The book contains over 260 figures illustrating how the algorithms work. Since we emphasize efficiency as a design criterion, we include careful analyses of the running times of all our algorithms. The text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures.
Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals.
We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a "pseudocode" designed to be readable by anyone who has done a little programming.
The book contains over 260 figures illustrating how the algorithms work. Since we emphasize efficiency as a design criterion, we include careful analyses of the running times of all our algorithms. The text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures.
Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals.
¿Por qué lo tengo? :
En el mundo informático se le conoce cariñosamente como "El CLRS" (por las iniciales de sus autores, leyendas del MIT).
Es el libro de algoritmos más famoso, respetado y utilizado del planeta. Da igual que sea la edición de finales de los 90; las estructuras de datos fundamentales (árboles binarios, grafos, tablas hash) y los algoritmos clásicos (ordenación, búsqueda, caminos mínimos como Dijkstra o Bellman-Ford) se explican hoy exactamente con el mismo pseudocódigo.
Te va a servir para asignaturas como Estructuras de Datos, Algoritmia, Complejidad y para preparar cualquier entrevista técnica de software en el futuro. Es una obra de arte.
Es el libro de algoritmos más famoso, respetado y utilizado del planeta. Da igual que sea la edición de finales de los 90; las estructuras de datos fundamentales (árboles binarios, grafos, tablas hash) y los algoritmos clásicos (ordenación, búsqueda, caminos mínimos como Dijkstra o Bellman-Ford) se explican hoy exactamente con el mismo pseudocódigo.
Te va a servir para asignaturas como Estructuras de Datos, Algoritmia, Complejidad y para preparar cualquier entrevista técnica de software en el futuro. Es una obra de arte.
ISBN-13 :
9780262031417-900000
ISBN-10 :
0262031418
Estado de Lectura :
Pendiente
Related items :
-
Fundamentos de algoritmia