Trade in Yours
For a 0.85 Gift Card
Trade in
Have one to sell? Sell yours here
Sorry, this item is not available in
Image not available for
Colour:
Image not available

 
Tell the Publisher!
Id like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Introduction to Algorithms (MIT Electrical Engineering and Computer Science) [Paperback]

T H Cormen
4.6 out of 5 stars  See all reviews (28 customer reviews)

Available from these sellers.


Formats

Amazon Price New from Used from
Hardcover --  
Paperback --  
Trade In this Item for up to 0.85
Trade in Introduction to Algorithms (MIT Electrical Engineering and Computer Science) for an Amazon Gift Card of up to 0.85, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Learn more
There is a newer edition of this item:
Introduction to Algorithms Introduction to Algorithms 4.3 out of 5 stars (6)
Currently unavailable

Book Description

29 Aug 1990 0262530910 978-0262530910 New edition
The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers. This edition is no longer available. Please see the Second Edition of this title.

Customers Who Viewed This Item Also Viewed


Product details

  • Paperback: 1048 pages
  • Publisher: MIT Press; New edition edition (29 Aug 1990)
  • Language: English
  • ISBN-10: 0262530910
  • ISBN-13: 978-0262530910
  • Product Dimensions: 4.5 x 0.3 x 5.3 cm
  • Average Customer Review: 4.6 out of 5 stars  See all reviews (28 customer reviews)
  • Amazon Bestsellers Rank: 1,262,381 in Books (See Top 100 in Books)
  • See Complete Table of Contents

More About the Authors

Discover books, learn about writers, and more.

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

What Other Items Do Customers Buy After Viewing This Item?


Customer Reviews

Most Helpful Customer Reviews
46 of 48 people found the following review helpful
5.0 out of 5 stars Complete, thorough... 3 Aug 1999
By A Customer
Format:Hardcover
Quote from a previous review:
Instead of touching on new technologies, such as AI, graphics, or anything else remotely relevant to today's demands on programmers and designers, this book, faithful to its MIT roots, gives a pompous, eggheaded distortion to the field of computers as a whole. Its focus is mainly on such trivialities as algorithm analysis, offering about 10 pages of proofs for each simple assertion. The points that the authors hope to make have no relevance whatsoever in a world in which processor power, not meticulous code optimization, reigns.
----------
I've had Cormen (one of the authors) as a professor in class, and my algorithms class uses this book, so admittedly my view might be a bit biased. But if you read the above (quoted) review, you might have gotten the wrong impression about this book. Cormen et. al. *intentionally* left "AI and graphics" algorithms to other authors; this isn't the place to cover those topics enough to do them justice. And as someone who has actually read the book, each proof is *not* 10 pages long. The examples are usually quite good, and concisely (if thoroughly explained). Finally, prof. Cormen always explains to his intro CS students why the study of algorithms is important, even as computers get faster and faster: some problems, poorly implemented, just *will not* run as well on a machine of today compared to a much older machine running a better algorithm. There will *always* be a justified place for the study and analysis of algorithms. Had the previous reviewer actually had met Prof. Cormen, he wouldn't be able to write the book off with the title of "pompous" or "eggheaded" either...
Comment | 
Was this review helpful to you?
8 of 8 people found the following review helpful
5.0 out of 5 stars the definitive algorithms book 22 July 1999
By A Customer
Format:Hardcover
This is the best CS book I've ever seen. Clearly written, with pseudo-code implementations for all the algorithms it describes. Its coverage is incredible, to this day whenever I have a need for an algorithm no matter in what area, first thing I do is look in CLR, and chances are it is in there.
Comment | 
Was this review helpful to you?
6 of 6 people found the following review helpful
5.0 out of 5 stars Without Equal. 6 April 1999
By A Customer
Format:Hardcover
This is *the* book on algorithms -- exhaustive and rigorous. If you're not up for straining your mind once in a while, you'll have a hard time of it; this is the textbook used in MIT's 6.046, and students at the Institvte are famed for their tolerance for ridiculous complexity. Rivest is the "R" in "RSA Encryption" and Cormen and Leiserson are deities of algorithmland, so you know this is one of the true authorities.
Be forewarned, however, that this is not a particularly accessible book for non-theoretical CS students. Mathematical foundation should be VERY solid.
Comment | 
Was this review helpful to you?
5 of 5 people found the following review helpful
5.0 out of 5 stars Excellent reference for all programmers!! 3 Aug 1998
By A Customer
Format:Hardcover
This is the definative quide to computer algorithms. It is not to be construed as an introduction by any means. It is an exhaustive text that answered all my questions that I had in college. The author uses pseudocode to illustrate the ideas and concepts which is benefical if you program in more than one language. It is the most widely used reference that I use in regard to algorithms. I highly recommend this book to those who are really serious about computer science and the study of algorithms. This book is not for novices. Some background in computer programming is required. Best computer alogrithms book I have ever seen so far.
Comment | 
Was this review helpful to you?
3 of 3 people found the following review helpful
By A Customer
Format:Hardcover
I read this book in college and we used it through almost every computer science course that I took. It is great for reference and to gain a clear understanding of data structures and algorithms. Just a great book to have in your library.
Comment | 
Was this review helpful to you?
2 of 2 people found the following review helpful
5.0 out of 5 stars An excellent text of moderate difficulty 26 Oct 1997
By A Customer
Format:Hardcover
An excellent survey of the field of algorithms. From a mathematical perspective its lighter than Knuth and heavier than Sedgewick. If your algebra is rusty you'll have some problems, but you don't have to be a math whiz either. If your just looking for an algorithm "cookbook" you'd be better off with something else, but if you're looking to gain a very solid "undergraduate" level understanding in algorithms you couldn't do any better.
Comment | 
Was this review helpful to you?
2 of 2 people found the following review helpful
5.0 out of 5 stars A must for every computing professional 17 Nov 1998
By A Customer
Format:Hardcover
This is not only a fine textbook for an academic course but also THE reference on algorithms for every programmer's library. It covers both general theory and loads of specific examples. The presentations are readable by anyone having a command of U.S. high-school mathematics. I've owned it for several years and I refer to it often.
Comment | 
Was this review helpful to you?
1 of 1 people found the following review helpful
5.0 out of 5 stars Great book! A must for each serious programmer. 29 July 1997
By A Customer
Format:Hardcover
This is complete and very thorough book about algorithms (sorting, balanced trees, and much more) and programming techniques such as dynamic programming. Don't be misleaded by the word "introduction" in the title. The book goes much far than an introduction. I must say although, that some topics could be explained in simpler ways. This is especially true for the topic of NP-complete problems. Despite this, it is very good and highly recommended book.
Comment | 
Was this review helpful to you?
Would you like to see more reviews about this item?
Were these reviews helpful?   Let us know
Most Recent Customer Reviews
4.0 out of 5 stars Good book...
AS a CS student, we had this book reccommnded for our data structures and our algorithms design courses. Read more
Published on 9 Aug 1999
4.0 out of 5 stars excellent book. a must for every software engineer.
this book was used in course for my algo course in IIT-K. this book has a nice and slow pace with lots of exercise at the end. highly recommended. Read more
Published on 14 July 1999
3.0 out of 5 stars O.K. Book
This book is ok if you just want to implement the stuff. also it gives an idea of newer topics (like amortized analysis etc. Read more
Published on 7 Jun 1999
4.0 out of 5 stars a good book but lack of example and hard to read
I was using this book for my algorithm class and found it quite usefull. My only complaint is that this book doesn't have clear example. Most examples were pseudocodes. Read more
Published on 4 May 1999
5.0 out of 5 stars An excellent course and reference book
Covering all important and interesting topics in computer science, this book can be used as a reference book by computer scientists as well as a course book for undergraduate and... Read more
Published on 10 Feb 1999
5.0 out of 5 stars Amazing Text
Cormen writes with amazing style and grace, his examples are coherent and strong. Cormen is considered a god-like figure in the study of algorithms and this book shows it. Read more
Published on 5 Jan 1999
5.0 out of 5 stars Too hard?
Are you confused by 'recursion'? Do you think NP stands for "Not Polynomial"? Well, then this is probably not the book for you. Read more
Published on 27 Dec 1998
4.0 out of 5 stars A Good Book not for Beginers.
The Authors have done a good job. They could have included good amount of examples in the first part which introduces Mathematical Background required. Read more
Published on 21 Dec 1998
5.0 out of 5 stars Very Comprehensive....
This is a very fine text on Algorithms. I was looking for a book explaining text search algorithms like Boyer Moore, etc. Read more
Published on 25 Nov 1998
Search Customer Reviews
Only search this product's reviews

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
Search all Amazon discussions
   


Look for similar items by category


Feedback