Introduction to Algorithms, Second Edition
By Clifford Stein,Ronald L. Rivest,Charles E. Leiserson,Thomas H. Cormen
Like Introduction to Algorithms, Second Edition ?
Join aNobii to see if your friends read it, and discover similar books!
Book Description
PLEASE NOTE: This is the international student paperback edition of this book. The MIT Press does not have sales rights for this paperback edition in the US and Canada. Customers in the US and Canada must order the hardcover edition.
Continue
12 Reviews

Ivan Idris said on Dec 27, 2011  Add your feedback

哩咖咖 said on Nov 5, 2011  Add your feedback

1 person finds this helpful
My personal library about Algorithms and Data Structures.
"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 ...(continue)Renato Perini said on Jul 7, 2011  Add your feedback

tinda said on Jan 25, 2010  Add your feedback

bznein said on Jan 22, 2010  Add your feedback

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 ps ...(continue)Rudolone said on Jan 7, 2010  Add your feedback
Book Details

Rating:
(210)
 English Books
 Paperback 1184 Pages
 ISBN10: 0262531968
 ISBN13: 9780262531962
 Publisher: The MIT Press
 Publish date: 20010901
 Dimensions: 322 mm x 1,289 mm x 1,483 mm
 Also available as: Hardcover
 In other languages: other languages 繁體書 , 简体书 , Libri Italiani
1 person finds this helpful
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 ...(continue)
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.
Is this helpful?