- Series: MIT Electrical Engineering and Computer Science
- Hardcover: 1048 pages
- Publisher: The MIT Press; Second Printing edition (June 18, 1990)
- Language: English
- ISBN-10: 0262031418
- ISBN-13: 978-0262031417
- Product Dimensions: 2 x 8.5 x 10.5 inches
- Shipping Weight: 4.9 pounds
- Average Customer Review: 575 customer reviews
- Amazon Best Sellers Rank: #716,562 in Books (See Top 100 in Books)
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.
To get the free app, enter your mobile phone number.
Introduction to Algorithms (MIT Electrical Engineering and Computer Science) Second Printing Edition
Use the Amazon App to scan ISBNs and compare prices.
Fulfillment by Amazon (FBA) is a service we offer sellers that lets them store their products in Amazon's fulfillment centers, and we directly pack, ship, and provide customer service for these products. Something we hope you'll especially enjoy: FBA items qualify for FREE Shipping and Amazon Prime.
If you're a seller, Fulfillment by Amazon can help you increase your sales. We invite you to learn more about Fulfillment by Amazon .
There is a newer edition of this item:
Customers who bought this item also bought
What other items do customers buy after viewing this item?
If you had to buy just one text on algorithms, Introduction to Algorithms is a magnificent choice. The book begins by considering the mathematical foundations of the analysis of algorithms and maintains this mathematical rigor throughout the work. The tools developed in these opening sections are then applied to sorting, data structures, graphs, and a variety of selected algorithms including computational geometry, string algorithms, parallel models of computation, fast Fourier transforms (FFTs), and more.
This book's strength lies in its encyclopedic range, clear exposition, and powerful analysis. Pseudo-code explanation of the algorithms coupled with proof of their accuracy makes this book is a great resource on the basic tools used to analyze the performance of algorithms.
About the Author
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College.
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
The book arrived in very good condition, but the printer have to pay attention when they cut the sheets, my book arrived with about 30 pages that doesn't fit quite well because of how they cut those sheets, but with scissors and being careful you can solve it easily. That's the reason I rate it with 4 stars, otherwise it is 5 stars. Check the other reviews on the content to decide whether to buy it or not, but I really recommend it.