Usando a câmera do seu celular, digitalize o código abaixo e baixe o app Kindle.
Introduction to Algorithms Capa dura – 1 setembro 2009
|Prazo||Valor Mensal (R$)||Total (R$)|
|10x sem juros||R$ 49,71||R$ 496,29|
|9x sem juros||R$ 55,17||R$ 496,29|
|8x sem juros||R$ 62,08||R$ 496,29|
|7x sem juros||R$ 70,95||R$ 496,29|
|6x sem juros||R$ 82,74||R$ 496,29|
|5x sem juros||R$ 99,29||R$ 496,29|
|4x sem juros||R$ 124,08||R$ 496,29|
|3x sem juros||R$ 165,43||R$ 496,29|
|2x sem juros||R$ 248,15||R$ 496,29|
Melhorar sua compra
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 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 a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press.
Descrição do produto
As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen et al book is the best textbook that I have ever seen on this subject. It offers an incisive, encyclopedic, and modern treatment of algorithms, and our department will continue to use it for teaching at both the graduate and undergraduate levels, as well as a reliable research reference.―Gabriel Robins, Department of Computer Science, University of Virginia
Introduction to Algorithms, the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance.―Daniel Spielman, Department of Computer Science, Yale University
Sobre o Autor
Detalhes do produto
- ASIN : 0262033844
- Editora : MIT Press (MA); 3rd ed. edição (1 setembro 2009)
- Idioma : Inglês
- Capa dura : 1292 páginas
- ISBN-10 : 9780262033848
- ISBN-13 : 978-0262033848
- Idade de leitura : 18 anos e acima
- Dimensões : 23.06 x 20.78 x 5.23 cm
- Ranking dos mais vendidos: Nº 100,241 em Livros (Conheça o Top 100 na categoria Livros)
- Avaliações dos clientes:
Sobre os autores
Avaliações de clientes
Principais avaliações do Brasil
Ocorreu um problema para filtrar as avaliações agora. Tente novamente mais tarde.
Principais avaliações de outros países
But I got it for a price of 900 Rs. Still, it's not correct for the seller to ship a Xerox copy. And the quality of the xerox is not good as well because in many pages, the ink is too light and almost not readable.
Coming to the book itself, it's a great book and no doubt it. Recommend this book to anyone who wants to study algorithms.
Avaliado no Reino Unido em 24 de março de 2019
That said, the approach, whilst detailed, is at times quite dry and heavy going, and could perhaps be broken up a little more to keep the reader refreshed and focused.
On balance given 5* for comprehensive coverage of algorithms and clear descriptions - but don't expect a pure cookbook of algorithms that can be typed in or downloaded.
The only place I could really find for Van Embde trees which apparently are the latest thing.
Very (very) comprehensive and worth persevering with - given its formality.
Really a must for reference.