Deliver to your Kindle or other device

 
 
 

Try it free

Sample the beginning of this book for free

Deliver to your Kindle or other device

Anybody can read Kindle books—even without a Kindle device—with the FREE Kindle app for smartphones, tablets and computers.
Introduction to Algorithms
 
 

Introduction to Algorithms [Print Replica] [Kindle Edition]

Thomas H. Cormen
4.2 out of 5 stars  See all reviews (17 customer reviews)

Print List Price: £43.95
Kindle Price: £32.75 includes VAT* & free wireless delivery via Amazon Whispernet
You Save: £11.20 (25%)
* Unlike print books, digital books are subject to VAT.

Formats

Amazon Price New from Used from
Kindle Edition £32.75  
Hardcover £41.57  
Paperback, Student Edition £36.79  
Kindle Daily Deal
Kindle Daily Deal: At least 60% off
Each day we unveil a new book deal at a specially discounted price--for that day only. Learn more about the Kindle Daily Deal or sign up for the Kindle Daily Deal Newsletter to receive free e-mail notifications about each day's deal.


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

Product Description

A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.

Product details

  • Format: Kindle Edition
  • File Size: 14292 KB
  • Print Length: 1312 pages
  • Publisher: MIT Press; third edition edition (15 Sep 2009)
  • Sold by: Amazon Media EU S.à r.l.
  • Language: English
  • ASIN: B007CNRCAO
  • Text-to-Speech: Not enabled
  • X-Ray:
  • Average Customer Review: 4.2 out of 5 stars  See all reviews (17 customer reviews)
  • Amazon Bestsellers Rank: #69,910 Paid in Kindle Store (See Top 100 Paid in Kindle Store)
  •  Would you like to give feedback on images?


More About the Authors

Discover books, learn about writers, and more.

What Other Items Do Customers Buy After Viewing This Item?


Customer Reviews

Most Helpful Customer Reviews
1 of 1 people found the following review helpful
4.0 out of 5 stars Great occasional reference 4 Mar 2014
By Neil
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?
15 of 19 people found the following review helpful
5.0 out of 5 stars De facto text book for Algorithms 11 Sep 2011
By Aloha
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?
3 of 4 people found the following review helpful
5.0 out of 5 stars Comprehensive, clear and rigorous 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?
5.0 out of 5 stars Great book, 10 May 2014
By N
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?
21 of 29 people found the following review helpful
5.0 out of 5 stars The Bible of Algorithms 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?
5 of 7 people found the following review helpful
5.0 out of 5 stars The book on the subject 27 Nov 2011
By Payam
Format:Paperback
Covers the subject for advanced, undergraduate and graduate public. good value for the money spent. Clear language and easy to follow.
Comment | 
Was this review helpful to you?
38 of 61 people found the following review helpful
1.0 out of 5 stars Beware Not proper Kindle Version 19 April 2012
Format:Kindle Edition|Verified Purchase
This book may have good content - I don't know because is too irritating to read !
this is because the publisher has been too lazy to produce a proper kindle version.
Very annoying at nearly £30 !
I use iPad 3 for all my reading in landscape mode - does not work well with this photocopy version
Constant panning and scanning and enlarging very tedious especially because reader lacks a default zoom option therefore needs constant resetting.
Amazes me how the publishers even those in IT have been so slow and poor at adapting to this new paradigm.
They are stupidly loosing a fortune. I would have bought many expensive books if available for kindle. I no longer buy heavy inconvenient printed technical books.
Was this review helpful to you?
3 of 6 people found the following review helpful
5.0 out of 5 stars From a newbie 11 Sep 2011
Format:Hardcover
I work like software professional and I think you need to know how things works in essence although you never have to program an algorithm in your day-to-day job. I love puzzles and challenge and this book is a good point to start to know algorithms. Next step: Art of computing programming by Donald E. Knuth.
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
Search Customer Reviews
Only search this product's reviews

Customer Discussions

This product's forum
See all discussions...  
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
   


Look for similar items by category