# Introduction to Algorithms, 3rd Edition

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, and substantial additions to the chapter on recurrences (now called “Divide-and-Conquer”). 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.

**Review**

“In light of the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. This beautifully written, thoughtfully organized book is the definitive introductory book on the design and analysis of algorithms. The first half offers an effective method to teach and study algorithms; the second half then engages more advanced readers and curious students with compelling material on both the possibilities and the challenges in this fascinating field.”

—Shang-Hua Teng, University of Southern California

“*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

“As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen 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

### Book Details

**Hardcover:**1312 pages**Publisher:**MIT Press; 3rd Edition (September, 2009)**Language:**English**ISBN-10:**0262033844**ISBN-13:**978-0262033848

This file is damaged.

Lovely

yeaah i have been waiting for it long time ago 🙂 THANK YOU VERY MUCH 🙂

I was looking for such a great quality for ages. Thanks, guys!!!

Thanks. Been looking for this for a long time.

Dave,File is not dammaged. Please try download again.

Tried downloading the file 3 times now. File is damaged and can not be opened. Please fix. Thanx

My bad, the file is fine, its silly Adobe Reader 8 that wont open it. Reads fine with Evince. Thanks!

Kai,Let upgrade to Adobe Reader X. It’s very fast and easy to read.

Thank you.

Thank you very much for this CS book. It’s working just fine in KDE Okular PDF reader.

Works fine with Adobe Reader 9.

Amazing

thanks for your time and efforts