CDN$ 92.10
  • List Price: CDN$ 105.03
  • You Save: CDN$ 12.93 (12%)
In Stock.
Ships from and sold by Amazon.ca.
Gift-wrap available.
Quantity:1
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Introduction to Algorithms Hardcover – Jul 31 2009


See all 5 formats and editions Hide other formats and editions
Amazon Price New from Used from
Kindle Edition
"Please retry"
Hardcover
"Please retry"
CDN$ 92.10
CDN$ 58.99 CDN$ 54.00

2014 Books Gift Guide
Thug Kitchen is featured in our 2014 Books Gift Guide. More gift ideas

Special Offers and Product Promotions

  • Join Amazon Student in Canada


Frequently Bought Together

Introduction to Algorithms + Cracking the Coding Interview: 150 Programming Questions and Solutions + Programming Pearls (2nd Edition)
Price For All Three: CDN$ 143.35


Customers Who Bought This Item Also Bought


Product Details

  • Hardcover: 1312 pages
  • Publisher: The MIT Press; third edition edition (July 31 2009)
  • Language: English
  • ISBN-10: 0262033844
  • ISBN-13: 978-0262033848
  • Product Dimensions: 20.3 x 4.5 x 22.9 cm
  • Shipping Weight: 2.1 Kg
  • Average Customer Review: 4.4 out of 5 stars  See all reviews (13 customer reviews)
  • Amazon Bestsellers Rank: #4,664 in Books (See Top 100 in Books)

Product Description

Review

As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen et al book is the best textbook that I have ever seen on this subject. It offers an incisive, encyclopedic, and modern treatment of algorithms, and our department will continue to use it for teaching at both the graduate and undergraduate levels, as well as a reliable research reference.

(Gabriel Robins, Department of Computer Science, University of Virginia)

Introduction to Algorithms, the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance.

(Daniel Spielman, Department of Computer Science, Yale University)

About the Author

Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009).

Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.

Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.

Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.

Inside This Book (Learn More)
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index
Search inside this book:

What Other Items Do Customers Buy After Viewing This Item?

Customer Reviews

4.4 out of 5 stars
Share your thoughts with other customers

Most helpful customer reviews

9 of 9 people found the following review helpful By Subb on June 5 2010
Format: Hardcover
This book is extremely well written. It covers a lot of ground, and it covers it deeply. Because of that, it might be a little hard for beginners; You'll need to skip over sections if you don't want to break your brain in half.

It's an excellent reference book. Some people think that a reference book is useless now because you can search on the internet, but I don't think you can find websites written as well as this book.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again.
3 of 3 people found the following review helpful By Gary on June 14 2014
Format: Hardcover Verified Purchase
I bought this book to learn algorithms in a self taught manner but it turns out to be "just" a reference book.
The book is well written and it covers a lot of topics.
It is very rigorous indeed. It's actually empathizes rigor over accessibility.
For a beginner like me it feels like learning to speech by reading the dictionary.

I would advise you buy this book of you already know the topic a minimum but need a reference OR if you are using it as a textbook in class.

To give you an idea of the target audience, there I actually stumbled upon an instance where the book had something like this:
"By exercise XXX, some given property is true" where XXX is an exercise given at the end of a previous chapter.
Come on... Can you not, for the lone learner, explain why such property is true?
And the book also mentions that only a portion of the exercises have correction because they want the teachers to be able to give exercise and make sure the students cannot google the solution.
It does make sense. But it's another hint of the targeted audience.

I will still rate 4, because as a reference book it's good.
But beginners: you've been warned.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again.
4 of 4 people found the following review helpful By Matt on Nov. 16 2010
Format: Hardcover
Still contains all the material which has made this book great. Some nice new additions though the removal of binomial heaps saddens me.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again.
1 of 1 people found the following review helpful By Roman Y. Blyshchyk on Feb. 7 2013
Format: Hardcover Verified Purchase
This book clearly describes all the concepts and theories with very informative examples and exercises. It takes you from very basics of the data structures and some simple algorithms into complex and fascinating problems.
If you are taking a course in Algorithms or just want to expand your knowledge, this book is for you!
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again.
By abc on March 7 2014
Format: Hardcover Verified Purchase
now i know i'm dumb. However the book is excellent at explaining complex concepts in as simple a way as possible, with a lot of helpful diagrams. It is an excellent book for a difficult subject.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again.
By Diana on Feb. 7 2014
Format: Hardcover Verified Purchase
People have called this the best book for algorithms. If you want to learn about algorithms and have no prior knowledge, this is what you want to read!
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again.
By Zheng Zeng on Nov. 8 2013
Format: Hardcover Verified Purchase
Nothing too much to talk about this book. It is so authoritative, rigorous and comprehensive. Every ITer needs this book at your desk for reference or studying, at anytime.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again.


Feedback