Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter mobile phone number.

Digital List Price:    6,438.18
Kindle Price:    1,064.00

Save    5,374.18 (83%)

includes free wireless delivery via Amazon Whispernet

These promotions will be applied to this item:

Some promotions may be combined; others are not eligible to be combined with other offers. For details, please see the Terms & Conditions associated with these promotions.

Deliver to your Kindle or other device

Deliver to your Kindle or other device

Introduction to Algorithms by [Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., Stein, Clifford]

Introduction to Algorithms 3rd , Kindle Edition

2.6 out of 5 stars 34 customer reviews

See all 3 formats and editions Hide other formats and editions
Price
New from
Kindle Edition
   1,064.00

Learn more about purchasing Kindle eBooks

Customers can now buy over 3 million Kindle books on Amazon.in with Indian credit/debit cards, net banking and Amazon.in Gift cards. > Learn 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

Product Description

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.


Product details

  • Format: Kindle Edition
  • File Size: 23479 KB
  • Print Length: 1312 pages
  • Publisher: The MIT Press; 3 edition (31 July 2009)
  • Sold by: Amazon Asia-Pacific Holdings Private Limited
  • Language: English
  • ASIN: B007CNRCAO
  • Text-to-Speech: Not enabled
  • X-Ray:
  • Word Wise: Not Enabled
  • Enhanced Typesetting: Not Enabled
  • Average Customer Review: 2.6 out of 5 stars 34 customer reviews
  • Amazon Bestsellers Rank: #22,279 Paid in Kindle Store (See Top 100 Paid in Kindle Store)
  • Would you like to tell us about a lower price?


What other items do customers buy after viewing this item?


Customer reviews

Top customer reviews

on 17 May 2017
Format: Paperback|Verified Purchase
0Comment| 4 people found this helpful. Was this review helpful to you?YesNoReport abuse
on 17 January 2017
Format: Paperback|Verified Purchase
0Comment| 6 people found this helpful. Was this review helpful to you?YesNoReport abuse
on 25 April 2017
Format: Paperback|Verified Purchase
0Comment| 3 people found this helpful. Was this review helpful to you?YesNoReport abuse
on 24 September 2017
Format: Paperback|Verified Purchase
0Comment| One person found this helpful. Was this review helpful to you?YesNoReport abuse
on 13 August 2017
Format: Paperback|Verified Purchase
0Comment| One person found this helpful. Was this review helpful to you?YesNoReport abuse
on 10 May 2017
Format: Paperback|Verified Purchase
0Comment| 2 people found this helpful. Was this review helpful to you?YesNoReport abuse
on 7 September 2015
Format: Kindle Edition|Verified Purchase
0Comment| 3 people found this helpful. Was this review helpful to you?YesNoReport abuse
on 27 May 2017
Format: Paperback|Verified Purchase
0Comment|Was this review helpful to you?YesNoReport abuse

Would you like to see more reviews about this item?

click to open popover

Where's My Stuff?

Delivery and Returns

Need Help?