Edición de la obra Introduction to Algorithms
| Autor | Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein |
|---|---|
| Editorial | McGraw-Hill Science/Engineering/Math |
| Fecha de publicación | July 16, 2001 |
| Idioma | inglés |
| Páginas | 1056 |
| ISBN-13 | 9780070131514 |
| ISBN-10 | 0070131511 |
| Número de Cutter | C811i |
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 figrues 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. --