Cargando…

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. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, wit...

Descripción completa

Detalles Bibliográficos
Clasificación:QA76.6 C6.75 2022
Autor principal: Cormen, Thomas H. (autor)
Otros Autores: Leiserson, Charles Eric (autor), Rivest, Ronald L. (autor), Stein, Clifford (autor)
Formato: Libro
Idioma:Inglés
Publicado: Cambridge, Massachusetts : The MIT Press, [2022].
Edición:Fourth edition.
Temas:
Descripción
Sumario:Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals
Descripción Física:xx, 1291 páginas : ilustraciones (algunas a color) ; 24 cm.
Bibliografía:Incluye referencias bibliográficas: páginas 1227-1250) e índice.