Introduction to Algorithms, 3rd Edition (The MIT Press)


Related Textbooks


Recent Blog Posts

Budgeting Tips For Students
3 Easy Ways to Save Money in College
4 Fictional Book Characters You'd Want to Be Best Friends With (And The Ones to Avoid)
6 New Fiction Releases for Character-Driven Readers in 2019
5 Must-Read Fiction Book Series for Adults

Other Links

Most Popular Textbooks
Most Popular High School Textbooks
Most Popular Associates Textbooks
Most Popular Bachelors Textbooks
Most Popular Masters Textbooks
Most Popular Doctoral Textbooks
Most Popular Vocational Textbooks
ISBN-10 / ISBN-130262033844 / 9780262033848
Edition3rd
AuthorThomas H. Cormen
PublisherThe MIT Press (on 2009-07-31)
Binding TypeHardcover
Number Of Pages1292
User Ratings
5 out of 5 stars (1 vote)
This book has been found by 1008 other users. Do you have this book? Trade it in for cash!
This textbook is primarily used in: (102 total votes)
High school courses16.67% (17 votes)
Associates programs4.9% (5 votes)
Bachelors programs56.86% (58 votes)
Masters programs17.65% (18 votes)
Vocational programs3.92% (4 votes)
Product Description

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

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 exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.

Amazon Reviews



Details compiled in 6.2956 seconds.

Amazon and the Amazon logo are trademarks of Amazon.com, Inc. or its affiliates.

Textbooknova.com is a participant in the Amazon Services LLC Associates Program, an affiliate advertising program designed to provide a means for sites to earn advertising fees by advertising and linking to Amazon.com

CERTAIN CONTENT THAT APPEARS ON TEXTBOOKNOVA.COM COMES FROM AMAZON SERVICES LLC. THIS CONTENT IS PROVIDED 'AS IS' AND IS SUBJECT TO CHANGE OR REMOVAL AT ANY TIME.