- Paperback: 1048 pages
- Publisher: MIT Press; New edition edition (29 Aug 1990)
- Language English
- ISBN-10: 0262530910
- ISBN-13: 978-0262530910
- Product Dimensions: 25.2 x 20.6 x 3.6 cm
- Average Customer Review: 4.6 out of 5 stars See all reviews (28 customer reviews)
-
Amazon Bestsellers Rank:
1,052,675 in Books (See Top 100 in Books)
- #19 in Books > Computers & Internet > Computer Science > Algorithms > Introduction
- #64 in Books > Scientific, Technical & Medical > Mathematics > Applied Mathematics > Mathematical Modelling
- See Complete Table of Contents
| ||||||||||||||||||
 Trade In this Item for up to £3.80
Get an extra £5 when you trade in books worth £10 or more until June 30, 2012. Trade in Introduction to Algorithms (MIT Electrical Engineering and Computer Science) for an Amazon.co.uk gift card of up to £3.80, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Find more products eligible for trade-in.
|
|
There is a newer edition of this item:
|
Product details |
More About the Authors
Discover books, learn about writers, and more.
Product Description
Product Description
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.
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product)
|
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
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...
8 of 8 people found the following review helpful
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.
6 of 6 people found the following review helpful
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.
Would you like to see more reviews about this item?
Were these reviews helpful?
Let us know
Most Recent Customer Reviews
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
This book is fundimental for all people in Computer Science.
I read this book in college and we used it through almost every computer science course that I took. Read more
Published on 21 July 1999
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
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
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
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
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
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
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
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
Listmania!
Look for similar items by category
- Books > Computing & Internet > Computer Science > Information Systems
- Books > Computing & Internet > Programming > Algorithms > Introduction
- Books > Science & Nature > Mathematics > Applied Mathematics
- Books > Science & Nature > Mathematics > Modelling
- Books > Science & Nature > Popular Science > Maths
- Books > Scientific, Technical & Medical > Mathematics > Applied Mathematics > Mathematical Modelling
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
