
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet or computer – no Kindle device required. Learn more
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera, scan the code below and download the Kindle app.


Introduction to Algorithms Paperback – Student Edition, Sept. 1 2001
There is a newer edition of this item:
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.
There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms 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 the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
- Print length1202 pages
- LanguageEnglish
- PublisherMit Pr
- Publication dateSept. 1 2001
- Dimensions20.3 x 4.41 x 22.9 cm
- ISBN-100262531968
- ISBN-13978-0262531962
Customers who viewed this item also viewed
Product description
About the Author
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.
Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.
Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.
Product details
- Publisher : Mit Pr; Student edition (Sept. 1 2001)
- Language : English
- Paperback : 1202 pages
- ISBN-10 : 0262531968
- ISBN-13 : 978-0262531962
- Item weight : 1.86 kg
- Dimensions : 20.3 x 4.41 x 22.9 cm
- Customer Reviews:
About the authors
Thomas H. Cormen is Emeritus Professor and former Chair of the Dartmouth College Department of Computer Science and former director of the Dartmouth College Institute for Writing and Rhetoric. He received the B.S.E. degree in Electrical Engineering and Computer Science from Princeton University in 1978 and the S.M. and Ph.D. degrees in Electrical Engineering and Computer Science from MIT in 1986 and 1993, respectively. He is coauthor of the leading textbook on computer algorithms, Introduction to Algorithms, which he wrote with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book, now in its fourth edition, has been translated into several languages. He is also the author of Algorithms Unlocked, a gentle introduction to understanding computer algorithms and how they relate to real-world problems.
Outside computer science, Cormen likes skating (inline and nordic), paddling, and cooking and eating barbecue. He considers himself the world's worst electrician who has a Ph.D. in electrical engineering.
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.
Ronald Linn Rivest (/rɪˈvɛst/; born May 6, 1947) is a cryptographer and an Institute Professor at MIT. He is a member of MIT's Department of Electrical Engineering and Computer Science (EECS) and a member of MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL). He was a member of the Election Assistance Commission's Technical Guidelines Development Committee, tasked with assisting the EAC in drafting the Voluntary Voting System Guidelines.
Rivest is one of the inventors of the RSA algorithm (along with Adi Shamir and Len Adleman). He is the inventor of the symmetric key encryption algorithms RC2, RC4, RC5, and co-inventor of RC6. The "RC" stands for "Rivest Cipher", or alternatively, "Ron's Code". (RC3 was broken at RSA Security during development; similarly, RC1 was never published.) He also authored the MD2, MD4, MD5 and MD6 cry.ptographic hash functions. In 2006, he published his invention of the ThreeBallot voting system, a voting system that incorporates the ability for the voter to discern that their vote was counted while still protecting their voter privacy. Most importantly, this system does not rely on cryptography at all. Stating "Our democracy is too important," he simultaneously placed ThreeBallot in the public domain.
Bio from Wikipedia, the free encyclopedia. Photo by Ronald L. Rivest (Own work) [CC BY-SA 4.0 (http://creativecommons.org/licenses/by-sa/4.0)], via Wikimedia Commons.
Customer reviews
-
Top reviews
Top reviews from Canada
There was a problem filtering reviews right now. Please try again later.
As a textbook, or for self-study, the book excels in clarity, coverage, and precision. It never lets go of the big picture, but still has every bit of detail you would want in an introductory text, with mathematical proofs of interesting properties of the algorithms introduced (and the first 6 chapters explain any mathematics you need).
As a reference, the book is immensely useful. Because almost any other algorithm book has a reasonable size, they must make a choice of what to cover. This book avoids the choice, and is therefore much thicker.
Of course, one book can't cover everything, the authors limit themselves to fundamental algorithms, anything related to parsing, semantic analysis, rewrite-systems, theorem-proving, computational biology, numerical analysis, computer graphics, machine-learning, signal-processing, or a number of other topics is better dealt with in a more specialized book. Still the coverage is unusually broad, and you would be hard pressed to find a more complete reference.
If you only want one book on algorithms, this is the book you want. If one algorithm-book isn't enough, you would still want this one, because it would be hard to even find a collection of books covering the same material. Besides, it will give you more shelf-space for other more advanced texts :-)
a) you had a bad instructor for the course
b) you find the material difficult
c) you can't understand pseudo-code
are not what I would call constructive or worthwhile critiques of the text of this excellent book. PLEASE society, PLEASE understand that some topics you have to actually WORK at understanding. It won't be spoon fed to you.
It seems moreso with Computer Science majors than other majors (I'm an electrical engineer undergrad, comp sci grad student) that they whine and whine and whine about the math or about it being difficult to actually have to work to understand something.
Oh my GOODNESS!!!! It's hard? Well, BLAME THE BOOK.
Rant over.
This book is amazing. It's the bible of algorithms and, to some extent, data structures. If you're not aforementioned whiners, feel free to buy this book, work hard, and learn a lot! There's not a better book out there in my experience.
Besides, it's not only a rigour academic text book but also problem and engineering oriented, unlike some other books on algorithms you might throw away after the schooling.
The only problem is: I cannot find solutions of the exercises in the book. Since the exercises are very well conceived and worth working out, there should be something to let the readers check if they are doing right.
Top reviews from other countries

No obstante es un libro denso, poco divulgativo (no se lee por placer, se lee para aprender a hacer algo concreto, algo que en general es dificil), y que requiere tiempo por la cantidad de conceptos y datos que aporta en cada una de sus páginas.
Un libro para tomárselo con calma, o para consultar y repasar conceptos cuando sea necesario. Ideal para gente con experiencia en programación, matemáticas o, al menos, algún trasfondo en materias lógicas. No recomendado para una persona que esté aprendiendo en frío o que nunca haya tenido una aproximación, al menos, a la programación.

Warum also nur 4 Sterne? Ja, das kommt durch die fehlenden Lösungen zu den meisten Übungen. Wenn schon Aufgaben in einem Buch gestellt werden, sollte man irgendwie an Lösungen dazu kommen. Ich bin ein absoluter Fan von Aufgaben in Lehrbüchern, aber die Lösungen sollten wenigstens im Internet zu finden sein, wenn schon nicht im Buch selbst. Das ist schade und kostet einen Stern.

この教科書はアルゴリズムとデータ構造における世界水準の入門書であると考えていい。(というか多くの人はそう考えている)当然だが、「Introduction to ALGORITHMS」であるから、プログラミング言語と結びつけてはおらず擬似コードで話は進められる。そこらあたりにあるアルゴリズムとデータ構造の本よりかは古本でもこの本を買ってしまえばいい。おそらく大学の講義(15週くらい)では絶対に終わらない内容がズラーと並んでいることから、アルゴリズムを専攻したい人、研究に使う人には手放せない一冊になることには違いない。
何を詳しく取り上げると言うのも題材がそもそも多すぎるので、述べないがアルゴリズムとは何かと言うのを10ページにわたりわりとしっかりかかれている。どうしても、大学で使っているアルゴリズムとデータ構造の教科書は難しいし、アルゴリズムは何に使われているのかなどが書かれておらず、アルゴリズムを初めて学ぶ人には敷居が高かった。そういう意味でこの本をサプリ的に買った。これを読めばアルゴリズムは面白いと必ず思わせてくれる。
これだけ長々と書いたが、要するに「世界水準」ということから読んでわかりにくいと言うことはまずないだろうし、ちゃんと理解できる。