Some books on algorithms are rigorous but incomplete; others cover massesof material but lack rigor. Introduction to Algorithms uniquely combine... read full description
reviews
Jul 20, 2011
Joecolelife
rated it: 
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...
Mar 22, 2011
Saharvetes
rated it: 
Rather pointless to review this, as in most places this is 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 More...
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 More...
Jul 26, 2010
Blog on Books
rated it:
Algorithms, which perform some sequence of mathematical operations, form the core of computer programming. Intended as a text for computer programming courses, especially undergraduate courses in data structures and graduate courses in algorithms, an “Introduction to Algorithms” provides a comprehensive overview, that will be appreciated technical professionals, as well.
The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Compute More...
The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Compute More...
Jul 20, 2010
Tim
rated it: 
Algorithms, which perform some sequence of mathematical operations, form the core of computer programming. Intended as a text for computer programming courses, especially undergraduate courses in data structures and graduate courses in algorithms, an “Introduction to Algorithms” provides a comprehensive overview, that will be appreciated technical professionals, as well.
The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Compute More...
The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Compute More...
Nov 19, 2010
Dmitry
rated it:
The book gives a solid foundation of common non-trivial algorithms and data structures. It all comes with nice pseudocode, detailed walk-throughs and complexity analysis (along with worst case, average case and amortized complexity).
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 provi More...
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 provi More...
Jun 10, 2011
Khaled
rated it:
An essential book for every programmer, you can't read this kind of book on bus, you need to fully constraint while reading it. The exercises after each chapter are very important to fully understand the chapter you just read, and to activate your brain's neurons. The book in itself is an outstanding one, very organized, focused and small chapters makes it easier to understand the algorithms inside it.
It contains the essential and most popular algorithms, so you can't live wthout it More...
It contains the essential and most popular algorithms, so you can't live wthout it More...
0 comments
like
(2 people liked it)
Aug 19, 2011
Dariush
rated it:
Definitely the best book I've ever read in algorithm design field till now.
This book has discovered every topics in a great depth, and the way that learns techniques is almost unique.
The best thing about this book is that the pseudocodes are very clear, without any confusion.
This book could be use to get ready for higher education exams.
And also could be a great reference for many basic algorithms, for programmers.
[ I highly recommend it for Computer s More...
This book has discovered every topics in a great depth, and the way that learns techniques is almost unique.
The best thing about this book is that the pseudocodes are very clear, without any confusion.
This book could be use to get ready for higher education exams.
And also could be a great reference for many basic algorithms, for programmers.
[ I highly recommend it for Computer s More...
0 comments
like
(1 person liked it)
Jan 29, 2012
Joke
rated it:
Das Buch wurde uns zur Vertiefung zur Vorlesung "Algorithmen und Datenstrukturen" empfohlen. Da es kein Skript im klassischen Sinn gab (dafür eine Mailingliste und eingescannte Notizen des Dozenten), war das Buch somit meine Hauptinformationsquelle für die Nachbereitung nach der Vorlesung. Dabei hat sich das Buch als extrem hilfreich erwiesen, obwohl natürlich nur ein Bruchteil des Buches überhaupt behandelt wurde, da das den Rahmen des 1. Semesters mit Sicherheit gesprengt hätte. Dazu
More...
Dec 13, 2007
Nick
rated it:
An essential, well-written reference, and one it's quite possible to read through several times, picking up new info each time. That having been said....this book never, I felt, adequately communicated THE LOVE. The pseudocode employed throughout is absolutely wretched, at times (especially in later chapters) binding up and abstracting away subsidiary computational processes not with actual predefined functions but english descriptions of modifications thereof -- decide whether you're writing co
More...
Dec 02, 2007
Alex
rated it:
While searching for a Bible of algorithms, I of course quickly gravitated towards Knuth's Art of Computer Programming series. It's 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 pr More...
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 pr More...
Dec 23, 2011
Gerardo
rated it:
This is an essential book for every computer engineer. The vast coverage of data structures and algorithms makes it a reference to have within a hand's reach. I love the way the authors use pseudocode to explain non-trivial topics as Red-Black Trees and even makes it enjoyable(if discrete mathematics is your kind of thing). But don't get fooled, this is not for lightreading.
I read it cover to cover and use it as a reference every once in a while.
I read it cover to cover and use it as a reference every once in a while.
Sep 16, 2008
Sunshine
rated it:
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 More...
an interesting feature, with respect to the exercises and especially problems for each chapter, is that i More...
Jul 09, 2010
John
rated it:
This is a really high three for me. I consider this book to be an essential reference. If you are a working programmer or a Computer Science student this book must be on your book self. It has excellent descriptions with great diagrams. It also not only covers the basics, but at the end of each section there is a list of more current and advanced topics with references. This book is a must have.
Aug 24, 2011
Andrew
rated it:
This was the textbook for my first year algorithms course at the university of toronto (1997). I recently bought the 3rd edition. Programmers should always have a good algorithm reference at their disposal. I try to read this from time to time - I wish the solutions to the problems in the book were available.
Dec 27, 2009
Kristjan
rated it:
This is an excellent introduction to the field of algorithms, introducing many of the basics.
If one wants to go in-dept into a given algorithm, this is not the book for it, but it will give you the basics, and show you where you can find more, allowing you to work your way into the subject.
If one wants to go in-dept into a given algorithm, this is not the book for it, but it will give you the basics, and show you where you can find more, allowing you to work your way into the subject.
Dec 26, 2011
Ivan
rated it:
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.
Aug 19, 2011
Anthony
rated it:
Extremely helpful, quite dense. If you expect to learn, be ready to work through the proofs and understand the steps. Don't attempt to just read through them and expend to "get it".
Feb 08, 2010
Brad
rated it:
The textbook on algorithms. It does not do a very good job of teaching how to design algorithms, but it is an authoritative catalog of algorithms for a wide variety of situations.
0 comments
like
(1 person liked it)
Sep 19, 2011
This was our textbook for my undergrad "Algorithms" course at the Hebrew University. It is clearly written and helpful. We used to call it "the Bible" of computer science...
Apr 30, 2011
Aaron
rated it:
An excellent reference with coverage of Big(O), basic data structures, and essential algorithms. Read and refer to as needed, and try them out in lots of languages!
Oct 24, 2009
Karol
rated it:
This is the ultimate knowledge base for algorithm problems and a massive source for optimization problems. Essential for every good software developer.
Mar 26, 2009
Bek
rated it:
I realize this is a textbook, but I have read it.
And it's like, the bible for my people... nerds.
And it's like, the bible for my people... nerds.
Jan 08, 2011
Ibrahim
rated it:
I bought this book in my second year in the BSc and then it was the textbook for an MSc course that I took several years later.
The book covers a wide range of topics; which is why, I think, it is famous. However, I did not like the writing style nor the way information are presented. Although I felt "safe" because I had a book that has something about almost everything in algorithms; I usually had to rely on other resources in order to better understand the algorithms I had
The book covers a wide range of topics; which is why, I think, it is famous. However, I did not like the writing style nor the way information are presented. Although I felt "safe" because I had a book that has something about almost everything in algorithms; I usually had to rely on other resources in order to better understand the algorithms I had
