Página InicialGruposDiscussãoMaisZeitgeist
Este sítio web usa «cookies» para fornecer os seus serviços, para melhorar o desempenho, para analítica e (se não estiver autenticado) para publicidade. Ao usar o LibraryThing está a reconhecer que leu e compreende os nossos Termos de Serviço e Política de Privacidade. A sua utilização deste sítio e serviços está sujeita a essas políticas e termos.
Hide this

Resultados dos Livros Google

Carregue numa fotografia para ir para os Livros Google.

Introduction to Algorithms, Second Edition…
A carregar...

Introduction to Algorithms, Second Edition (edição 2001)

por Thomas H. Cormen

MembrosCríticasPopularidadeAvaliação médiaMenções
2,41564,509 (4.27)2
A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.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. The international paperback edition is no longer available; the hardcover is available worldwide.… (mais)
Membro:lokigao
Título:Introduction to Algorithms, Second Edition
Autores:Thomas H. Cormen
Informação:The MIT Press (2001), Edition: 2nd, Hardcover, 1184 pages
Colecções:A sua biblioteca
Avaliação:
Etiquetas:Wishlist

Pormenores da obra

Introduction to Algorithms por Thomas H. Cormen

  1. 10
    The Art of Computer Programming, Volumes 1-3 Boxed Set por Donald E. Knuth (billmcn)
    billmcn: The other definitive algorithms textbook, though I like Cormen better because it's shorter and more accessible.
Nenhum(a)
A carregar...

Adira ao LibraryThing para descobrir se irá gostar deste livro.

Ainda não há conversas na Discussão sobre este livro.

» Ver também 2 menções

Mostrando 1-5 de 6 (seguinte | mostrar todos)
apparently the second most cited computer science book, and for good reason. (no, i don't know the top most cited, and no, its not knuth). but, what a vast and exciting array of pseudocode, algorithms, and their data structures! good largley for being rich and dense, but readable. doesn't waste space over explaining, but should be sufficient for most anyone with a active interest.

an interesting feature, with respect to the exercises and especially problems for each chapter, is that i think cormen subscribes to a methodology where the solution to a problem should often require information or intuition not found in the chapter, nor even necessarily in the preceding chapters. you find yourself driving towards solutions that are used in later sections, or revisiting old problems once you find a better solution later on.

and, of course, cormen is here at dartmouth. one should probably always have a copy handy when writing code. ( )
1 vote jmilloy | Nov 8, 2017 |
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. ( )
  IvanIdris | Dec 26, 2011 |
Normally I wouldn't review a textbook, but reading this one is enjoyable.

It's one of the very best textbooks I've ever used. Unbelievably well written. Well organized. Great examples and pictures. Clearly explained proofs. It is easy to read and learn from. I'm surprised I was able to get an already-used copy of this book; I'll be keeping mine for a very long time. ( )
  pammab | Dec 15, 2011 |
The definitive graduate or upper-level undergraduate computer science textbook. This is the place to go to learn basic algorithms, data structures, proofs of correctness, and big-O notation. I prefer it to Knuth's three-volume opus, because it's shorter and doesn't get bogged down in the details of an artificial assembly language.

Cormen et al. also makes for a fine self-study guide. If you're reading it on your own, check out the MIT Open Course Introduction to Algorithms class, which has a full set of online lectures and problem sets based on this book. ( )
2 vote billmcn | May 28, 2010 |
Esta crítica foi assinalada por vários utilizadores como um abuso dos termos do serviço. Por isso, não é mostrada (mostrar).
  knol | Dec 25, 2009 |
Mostrando 1-5 de 6 (seguinte | mostrar todos)
sem críticas | adicionar uma crítica

» Adicionar outros autores (57 possíveis)

Nome do autorPapelTipo de autorObra?Estado
Thomas H. Cormenautor principaltodas as ediçõescalculated
Leiserson, Charles E.Autorautor principaltodas as ediçõesconfirmado
Rivest, Ronald L.Autorautor principaltodas as ediçõesconfirmado
Stein, Cliffordautor principaltodas as ediçõesconfirmado
Tem de autenticar-se para poder editar dados do Conhecimento Comum.
Para mais ajuda veja a página de ajuda do Conhecimento Comum.
Título canónico
Informação do Conhecimento Comum em inglês. Edite para a localizar na sua língua.
Título original
Títulos alternativos
Informação do Conhecimento Comum em inglês. Edite para a localizar na sua língua.
Data da publicação original
Pessoas/Personagens
Locais importantes
Acontecimentos importantes
Filmes relacionados
Prémios e menções honrosas
Epígrafe
Dedicatória
Primeiras palavras
Informação do Conhecimento Comum em inglês. Edite para a localizar na sua língua.
What are algorithms?
Citações
Últimas palavras
Nota de desambiguação
Editores da Editora
Autores de citações elogiosas (normalmente na contracapa do livro)
Língua original
DDC/MDS canónico
A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.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. The international paperback edition is no longer available; the hardcover is available worldwide.

Não foram encontradas descrições de bibliotecas.

Descrição do livro
Resumo Haiku

Ligações Rápidas

Capas populares

Avaliação

Média: (4.27)
0.5
1 1
1.5
2 6
2.5
3 33
3.5 1
4 107
4.5 9
5 119

É você?

Torne-se num Autor LibraryThing.

 

Acerca | Contacto | LibraryThing.com | Privacidade/Termos | Ajuda/Perguntas Frequentes | Blogue | Loja | APIs | TinyCat | Bibliotecas Legadas | Primeiros Críticos | Conhecimento Comum | 155,811,823 livros! | Barra de topo: Sempre visível