By Clifford Stein,Ronald L. Rivest,Charles E. Leiserson,Thomas H. Cormen
Publisher: The MIT Press
Language:English | Number of Pages: 1184 | Format: Paperback | In other languages: (other languages) Chi simplified , Italian , Chi traditional
Isbn-10: 0262531968 | Isbn-13: 9780262531962 | Publish date: 01/09/2001 | Edition 2
Also available as: Hardcover
Category: Computer & Technology , Reference , Textbook
Do you like Introduction to Algorithms, Second Edition ?
Join aNobii to see if your friends read it, and discover similar books!
Ivan Idris said on Dec 27, 2011, 12:05
哩咖咖 said on Nov 05, 2011, 09:22
"Algorithms and Data Structures" is a huge field.
Lot of algorithms and data structures are used in nowadays computer software of variuos kinds. Not all data structures or algorithms on them are adequate for solving a particular problem, so you must have some skills to say which one is "better" t ...continue
"Algorithms and Data Structures" is a huge field. Lot of algorithms and data structures are used in nowadays computer software of variuos kinds. Not all data structures or algorithms on them are adequate for solving a particular problem, so you must have some skills to say which one is "better" than another in your particular situation. Despite it's name, this book is an almost complete reference to achieve this skills. Sure, material presented here is not so easy and the book is not something you can read while watching MTV. Each chapter presents an argument in a very concise and formal way. Too much for some people, but this is not bad. Just skipping what you don't/want understand is the primary key to appreciate this book. When you will master the main concepts of the argument you are interested, it's a pleasure returning on those parts you have precedently skipped. Parts about sorting and selections (heapsort, quicksort, linear sorting, etc.), common data structures (stacks and queues, hash tables, search binary trees, red-black trees), advanced data structures (B trees, binomial heaps, Fibonacci's heaps etc.) and algorithms on graphs (depth first traversal, minimum set cover, Kruskal and Prim's algorithms, Bellman-Ford's method, Dijkstra's algorithm) are well written and you can consider this parts as a reference for the future. But this book as bad things too. The pseudocode, even if comprehensible, is not so much readable. In some cases it's too much dependent by the contest and this increase your understanding time. Chapters about math reference are not clear at all. Too much arguments without too much explanations, especially sections about algorithm's analisys. The last part of this book about complements and extensions could be easily dropped off from the book. Material presented here don't fit in an introductory text about algorithms and needs other knowledge a person who is reading this book obviously don't has. A note on what that particular data structure is useful for would be very appreciated. Good book. Well spent money.
Renato Perini said on Jul 07, 2011, 10:22
tinda said on Jan 25, 2010, 03:03
Un vangelo dei programmatori, assolutamente il testo di riferimento per il tema algoritmi e strutture dati!
bznein said on Jan 22, 2010, 12:08
Il "Cormen" è usato da gran parte dei corsi universitari di algoritmi e strutture dati. Si tratta di un testo rigoroso, preciso, complesso e ricco di esercizi (da evitare se ci si vuole dedicare all'argomento a tempo perso).
Peccato per l'orribile pseudo-linguaggio utilizzato per codificare gli e ...continue
Il "Cormen" è usato da gran parte dei corsi universitari di algoritmi e strutture dati. Si tratta di un testo rigoroso, preciso, complesso e ricco di esercizi (da evitare se ci si vuole dedicare all'argomento a tempo perso). Peccato per l'orribile pseudo-linguaggio utilizzato per codificare gli esempi, uno pseudo-pascal, con stranezze tipo la notazione attributo[oggetto].
Rudolone said on Jan 07, 2010, 21:55
Andrea Mostosi said on Jan 07, 2010, 08:31
This is a classic textbook of Algorithms which is a must-read for EECS major students. The book is written by MIT professors.
Schechters said on Jun 18, 2008, 16:38
This book is a very comprehensive approach to the basics of algorithmic studies. It is not necessary to finish every section of this book, but pick the earlier parts ( introductory ) and then choose some selected topics of one's interest. In time, one will discover this will be very critical to a ...continue
This book is a very comprehensive approach to the basics of algorithmic studies. It is not necessary to finish every section of this book, but pick the earlier parts ( introductory ) and then choose some selected topics of one's interest. In time, one will discover this will be very critical to advance onto many other difficult topics.
Lo哥 said on Nov 27, 2007, 16:23
haocheng said on Oct 25, 2007, 15:35
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.