Goodreads helps you keep track of books you want to read.

Start by marking “Introduction to Algorithms” as Want to Read:

# Introduction to Algorithms

*NOTE: This International Student Edition is not available in the USA or Canada.*

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

Paperback, Third Edition, 1312 pages

Published
September 1st 2009
by Mit Press
(first published December 1st 1989)

## Friend Reviews

To see what your friends thought of this book,
please sign up.

## Reader Q&A

To ask other readers questions about
Introduction to Algorithms,
please sign up.

### Recent Questions

This book is not yet featured on Listopia.
Add this book to your favorite list »

## Community Reviews

(showing
1-30
of
3,000)

It tries to be a reference book presenting a good summary of algorithms but any of the interesting bits are left as "exercises to the student." Many of these exercises are do-able but far from trivial mental connections. A few require some mental Ah Ha ...more

*the*algorithms textbook. It's a good book that covers all the major algorithms in sufficient detail with every step clearly spelled out for the students' benefit.

Unfortunately, this neatness of presentation is also its most major drawback: (1) it spends more time

*describing*algorithms than giving the reader an idea of how to

*design*them, and (2) it can easily give the impression that algorithms is about spending a lot of time proving obv ...more

It contains the essential and most popular algorithms, so you can't live wthout it if you are r ...more

*thousands*of pages long —a magnum opus still in progress; how could it

*not*be the most desirable source?

My research quickly yielded mixed opinions from the community. Some loved Knuth's books, while others found their language impenetrable, their code irrelevant, or their assertions wrong or out of date.

All, on the other hand, universally praised Introduction to Alg ...more

Jul 20, 2011
Joecolelife
rated it
5 of 5 stars
·
review of another edition

Recommended to Joecolelife by:
www.CocoMartini.com

Shelves:
college-textbooks

This book is outstanding. All the algorithms are given in pseudo code which make the material (and notation) very precise and devoid of any idiosyncrasies which a real programming language might introduce. Although, the book requires fairly decent mathematical background, the more complex math can be skipped on a first reading (to avoid getting bogged down). Of course, you still need to know the basics of discrete mathematics and it will serve you well throughout this book. All algorithms are co
...more

The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Computer programmer ...more

The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Computer programmer ...more

an interesting feature, with respect to the exercises and especially problems for each chapter, is that i think corme ...more

The pseudo code is very helpful.

The problem is the formal style of writing.

It would be much better if the author can hide the formal forms of proof in the appendix and focus on the logic but not rigorous mathematical expression of how an algorithm works.

I also agree with some others that this book could have a stronger emphasis on data structure.

Personally I'd prefer to see the material in much more compact form, covering more of topics and more advanced or tricky algorithms and data structures. However, when something isn't clear, the detailed walk-throughs really help. Also, the exercises provided are inva ...more

*Introduction to Algorithms*had been my first textbook, I wouldn't be.

(Also, I wish editors would stop writers when they try to use 1-indexed arrays in their books. Or, for that matter, pseudocode in general. Machi ...more

Feb 27, 2015
Kamyar Nadimi
rated it
4 of 5 stars
·
review of another edition

Shelves:
read-incomplete

Simple explanation on complex algorithms

topics | posts | views | last activity | |
---|---|---|---|---|

about the book | 6 | 65 | May 01, 2015 06:29PM |

## Goodreads is hiring!

Thomas H. Cormen is the co-author of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein. He is a Full Professor of computer science at Dartmouth College and currently Chair of the Dartmouth College Writing Program.

More about Thomas H. Cormen...
## Share This Book

No trivia or quizzes yet. Add some now »

Apr 14, 2013 09:37PM

Dec 26, 2013 11:45PM

Jan 03, 2014 01:58PM