Vous voulez voir cette page en français ? Cliquez ici.


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here

Introduction to Algorithms [Hardcover]

Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , Clifford Stein
4.7 out of 5 stars  See all reviews (11 customer reviews)
List Price: CDN$ 98.73
Price: CDN$ 91.28 & FREE Shipping. Details
You Save: CDN$ 7.45 (8%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.ca. Gift-wrap available.
Want it delivered Tuesday, September 2? Choose One-Day Shipping at checkout.

Formats

Amazon Price New from Used from
Kindle Edition CDN $72.77  
Hardcover CDN $91.28  
Paperback CDN $76.60  
Save Up to 90% on Textbooks
Hit the books in Amazon.ca's Textbook Store and save up to 90% on used textbooks and 35% on new textbooks. Learn more.
Join Amazon Student in Canada


Book Description

July 31 2009 0262033844 978-0262033848 third edition

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press.


Frequently Bought Together

Introduction to Algorithms + Cracking the Coding Interview: 150 Programming Questions and Solutions
Price For Both: CDN$ 117.58


Customers Who Bought This Item Also Bought


Product Details


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

(Daniel Spielman)

" 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

3 star
0
2 star
0
1 star
0
4.7 out of 5 stars
4.7 out of 5 stars
Most helpful customer reviews
8 of 8 people found the following review helpful
4.0 out of 5 stars Good reference June 5 2010
By Subb
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?
4 of 4 people found the following review helpful
5.0 out of 5 stars Continues strong Nov. 16 2010
By Matt
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?
1 of 1 people found the following review helpful
5.0 out of 5 stars The Bible of Algorithms 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?
4.0 out of 5 stars Only for reference June 14 2014
By Gary
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?
5.0 out of 5 stars I thought i was smart March 7 2014
By abc
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?
5.0 out of 5 stars Great Book Feb. 7 2014
By Diana
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?
Want to see more reviews on this item?

Look for similar items by category


Feedback