Sign in with Facebook
Loading...
Introduction To Algorithms
Aimed at any serious programmer or computer science student, the new second edition of Introduction to Algorithms builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the math-averse, this title sets a high standard for a textbook and reference to the bes...more
Published
(first published March 1st 1990)
Friend Reviews
To see what your friends thought of this book,
please sign up.
This book is not yet featured on Listopia.
Add this book to your favorite list »
Community Reviews
(showing
1-30
of
3,000)
What a terrible book. Though it's the cornerstone of many CS undergrad algorithm courses, this book fails in every way. In almost every way, Dasgupta and Papadimitriou's "Algorithms" is a much better choice: http://www.goodreads.com/book/show/13...
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
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
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
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 proving obv...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 proving obv...more
2 likes · like · see review
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. Computer programmer...more
The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Computer programmer...more
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. Computer programmer...more
The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Computer programmer...more
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 provided are inva...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 provided are inva...more
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 if you are r...more
It contains the essential and most popular algorithms, so you can't live wthout it if you are r...more
This book, like several of the other college textbooks I have bought, has several really good chapters....but also many, many pages which I consider "bloat." I personally would greatly prefer an extraction of the key topics without hundreds of pages of "had to keep releasing new editions of this textbook every year so we had to add more chapters on increasingly wide ranging and arcane topics." Anyways, the core chapters are very nice - it also contains a lot of "review" e.g. discussion on mathem...more
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 science, IT students, and beginner programm...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 science, IT students, and beginner programm...more
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 kommt noc...more
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
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 praised Introduction to Alg...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 praised Introduction to Alg...more
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.
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 think corme...more
an interesting feature, with respect to the exercises and especially problems for each chapter, is that i think corme...more
Good book to read if you are interested in learning some good computer algorithms or are new to the algorithm space. I read this book when I was doing my computer science course at Stanford and it helped when I was going through the Algorithms section of the course. Provides a great overview if you want to understand how computers sort.
I still refer to this every now and then I need to implement algorithms at a lower level.
I still refer to this every now and then I need to implement algorithms at a lower level.
Jul 09, 2010
John Chilton
rated it
3 of 5 stars
·
review of another edition
Shelves:
highly-recommended
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.
I felt proud that I worked through the entire book on my own. There are a number of places where the authors skip steps in the mathematical proofs, probably because the details are obvious to the authors and maybe most mathematically inclined readers (and also to save space), but it would have made it easier to follow if those details were present. Top of the line reference text.
Jan 04, 2013
Steve
rated it
3 of 5 stars
·
review of another edition
Shelves:
non-fiction,
read-in-school
Essential reading for Computer Science students. I enjoyed digging into these algorithms, although it takes some commitment to understand some of the more complicated ones. I think having them in pseudo-code is really useful for anyone looking to implement them in a specific language. If you enjoy math, pick up a copy of this book.
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.
Sep 26, 2012
Robert Stewart
rated it
5 of 5 stars
·
review of another edition
Shelves:
partially-read
I certainly didn't read this book cover to cover, but I read several chapters and skimmed many more while in grad school. The explanations are excellent. All I needed was a quick read of the section on red-black trees and I was able to knock out a C++ implementation with very little trouble.
Dec 27, 2009
Kristjan Wager
rated it
4 of 5 stars
·
review of another edition
Shelves:
programming-and-systems-development
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.
الشيء الرائع في هذا الكتاب هو أنه يأخذ بيدك إلى أصعب الأفكار وأعقدها بلغة بسيطة ومتينة وخالية من أية أخطاء متعمدة للتبسيط، وبدون استصغار لعقلك :)
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.
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".
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.
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...
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!
This is an excellent book for software engineers and students of computer science and engineering who want to have a good understanding of algorithms.
This is the ultimate knowledge base for algorithm problems and a massive source for optimization problems. Essential for every good software developer.
i think its best algorithms book i read so far.
well-organized, comprehensive, simple yet introduce advanced techniques for problem solving.
well-organized, comprehensive, simple yet introduce advanced techniques for problem solving.
| topics | posts | views | last activity | |
|---|---|---|---|---|
| about the book | 4 | 44 | Aug 30, 2012 12:36pm |
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