S$71.40
S$1.99 delivery: 18 - 22 May Details
Only 5 left in stock.
Ships from and sold by avrs for you, from outside Singapore. For information about products sold by international sellers, click here.
Other Sellers on Amazon
S$81.99
+ FREE Delivery
Sold by: BholdersSG
S$83.91
+ S$27.10 delivery
Sold by: Amazon US
S$137.00
& FREE postage on eligible orders. See details and conditions
Sold by: Amazon SG
Have one to sell?

Introduction to Algorithms Hardcover – 31 July 2009

4.6 out of 5 stars 826 ratings

See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
Hardcover
S$71.40
S$71.40

Enhance your purchase

click to open popover

Frequently bought together

  • Introduction to Algorithms
  • +
  • Cracking the Coding Interview: 189 Programming Questions and Solutions
Total Price: S$114.80
Buy the selected items together
Best books of 2020
See top titles of the year

Product details

  • ASIN : 0262033844
  • Language : English
  • Hardcover : 1320 pages
  • ISBN-10 : 9780262033848
  • ISBN-13 : 978-0262033848
  • Reading age : 18 years and up
  • Customer reviews:
    4.6 out of 5 stars 826 ratings

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.

No customer reviews

5 star (0%) 0%
4 star (0%) 0%
3 star (0%) 0%
2 star (0%) 0%
1 star (0%) 0%
How are ratings calculated?

Review this product

Share your thoughts with other customers

Most helpful customer reviews on Amazon.com

Amazon.com: 4.2 out of 5 stars 413 reviews
thomas scanlan
4.0 out of 5 stars Helpful text, but not sufficient as sole resource
1 February 2019 - Published on Amazon.com
Verified Purchase
34 people found this helpful
Matthew
3.0 out of 5 stars Good, But Still Very Complex!
21 March 2016 - Published on Amazon.com
Verified Purchase
158 people found this helpful
Ben Bitdiddle
4.0 out of 5 stars Text is pretty good but has pedagogical weaknesses
7 October 2016 - Published on Amazon.com
Verified Purchase
69 people found this helpful
CyrixLord
3.0 out of 5 stars very mathy
30 October 2018 - Published on Amazon.com
Verified Purchase
28 people found this helpful
T
4.0 out of 5 stars Top-Notch Content, Poor Binding
4 June 2016 - Published on Amazon.com
Verified Purchase
Customer image
4.0 out of 5 stars Top-Notch Content, Poor Binding
Reviewed in the United States on 4 June 2016
This is probably the most well known and most used textbook on the subject, and with good reason. An excellent resource, covering just about everything you need to know for a good understanding of Algorithms. (side tip, my friends in the industry call this the "How To Pass a Google Interview" book).

My only complaint is that the binding has completely stated disintegrating after only 9 weeks of use. All of chapters 15 and 16 are completely falling out of my copy (and this is getting worse). Very disappointing as I plan on using it for a long time.
Images in this review
Customer image
Customer image
35 people found this helpful