£39.56
  • RRP: £43.95
  • You Save: £4.39 (10%)
FREE Delivery in the UK.
In stock.
Dispatched from and sold by Amazon.
Gift-wrap available.
Quantity:1
Introduction to Algorithm... has been added to your Basket
Trade in your item
Get a £12.72
Gift Card.
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 Paperback – Student Edition, 20 Aug 2009


See all 6 formats and editions Hide other formats and editions
Amazon Price New from Used from
Kindle Edition
"Please retry"
Paperback, Student Edition
"Please retry"
£39.56
£21.98 £20.98
£39.56 FREE Delivery in the UK. In stock. Dispatched from and sold by Amazon. Gift-wrap available.

Frequently Bought Together

Introduction to Algorithms + Cracking the Coding Interview: 150 Programming Questions and Solutions
Price For Both: £64.51

Buy the selected items together

Customers Who Bought This Item Also Bought


Trade In this Item for up to £12.72
Trade in Introduction to Algorithms for an Amazon Gift Card of up to £12.72, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Learn more

Product details

  • Paperback: 1312 pages
  • Publisher: MIT Press; 3rd edition (20 Aug 2009)
  • Language: English
  • ISBN-10: 0262533057
  • ISBN-13: 978-0262533058
  • Product Dimensions: 20.3 x 4.5 x 22.9 cm
  • Average Customer Review: 4.5 out of 5 stars  See all reviews (20 customer reviews)
  • Amazon Bestsellers Rank: 46,809 in Books (See Top 100 in Books)

More About the Authors

Discover books, learn about writers, and more.

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 and search another edition of this book.
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.5 out of 5 stars
Share your thoughts with other customers

Most Helpful Customer Reviews

1 of 1 people found the following review helpful By Neil on 4 Mar 2014
Format: Paperback Verified Purchase
As has been said numerous times about this books, its one of those classics that you just must own. That said, it isn't the kind of book you'd read from cover to cover in one go. More likely, it will spend most of its time on the bookshelf, but act as a handy reference every once in a while when you're stuck on a problem with an algorithmic solution. Also helpful to prepare for coding interviews, although with the kind of time crunch you're likely under, you might prefer Cracking the Coding Interview.
Comment 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
15 of 19 people found the following review helpful By Aloha on 11 Sep 2011
Format: Paperback
De facto text book for Algorithms

Who need this book

Programmer who want to optimize their algorithms or just want to brush up different algorithms which they use in their day to day programming.

Student who are learning Computer science at university, this book is must have for them.

Book is divided in following main sections

1.Foundations

This section has 5 chapters and gives the basic idea about the algorithms and how to solve a problem using an algorithm and different approach about the algorithms.

Explain about the notation of algorithms and how to write a one.

Explain how to calculate the complexity of algorithms and along with the different notations such as big o etc.

2.Sorting and Order Statistics
This section is devoted to different sorting algorithms such as quick and heap etc, there are 4 chapters in total.

3.Data Structures
This section gives basic idea about the data structure before advance section; this section includes stack, link list, queue, hash table etc.

There are 5 chapters in total for basic data structures.

4.Advanced design and analysis technique
This section has 3 chapters and explains dynamic programming, greedy algorithms and amortized analysis.

5.Advance Data Structures

This section explains about B tree, Fibonacci heap, van Emde Boas tree and disjoint set.

6.Graph algorithms
This section explains about different graph algorithms such dijkstra and shortest path algorithms etc.

7.Selected topics
this section has some different topics such as multithreaded algorithms, matrix operation , string matching and pattern matching etc.

Point about book.
Read more ›
Comment 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 4 people found the following review helpful By jClark94 on 20 May 2013
Format: Paperback Verified Purchase
This textbook is on the reading list for a number of courses for my degree, even if, at first glance, the connection is not always obvious. The title is something of a misnomer: it is not only an introduction to algorithms for those at an undergraduate level, but I can also see it being massively useful in a professional field, when an obscure data structure is needed, and an efficient implementation of a niche algorithm is required; followed by a careful and sound explanation of its correctness. It is not just an introduction, but also one of the most thorough analyses of algorithms ever found. There are countless references to it in my other textbooks, and the reference CLRS is enough to know exactly which book is being referred to.

This will stand me in good stead for many, many years.
Comment 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 N on 10 May 2014
Format: Paperback Verified Purchase
Its a great print out, efficient, there's nothing wrong with it, i love the thin paper quality it just brings so much information into a little lighter weight thanks alot for this one
Comment 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
22 of 30 people found the following review helpful By Avid Amazon'er! on 31 Jan 2010
Format: Paperback Verified Purchase
This book is brilliant. I bought this to read from cover to cover, so that I could get a 'head-start' before going to university on a Computer Science course. This is perfect as it contains everything you need and more! In addition the book is great as a reference book - if you forgot about Van Emde Boas Trees then you can remind yourself by reading the appropriate chapter. A Must Have For Every Computer Scientist.
Comment 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 Sabir on 6 Nov 2014
Format: Hardcover Verified Purchase
Got my Algorithms Bible. We all know it's the best Algorithm book out there so I'd prefer rating Amazon for the great price of this book, an impeccable and fast delivery. Now I can use my holidays and work through the book.
Comment 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
Format: Paperback
Took a while to be delivered, (about a month) but it's a difficult book to find. Quality is near perfect.
Comment 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 Anthony on 23 Oct 2014
Format: Paperback Verified Purchase
Heady stuff. But the book does a great job of easing you into the brain crushing world of algorithms.
Comment 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