**Hardcover**|

**$92.00 Text**|

**£63.95**| ISBN: 9780262033848 | 1312 pp. | 8 x 9 in | 235 b&w illus.| July 2009

**Paperback**|

**$70.00 Text**|

**£43.95**| ISBN: 9780262533058 | 1312 pp. | 8 x 9 in | 235 b&w illus.| July 2009

**ebook**|

**$92.00 Short**| ISBN: 9780262259460 | 1312 pp. | 8 x 9 in | 235 b&w illus.| July 2009

Paperback edition is not for sale in the U.S. or Canada.

## Look Inside

## Essential Info

## Instructor Resources

# Introduction to Algorithms, third edition

## Overview

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.

**Downloadable instructor resources available for this title: instructor’s manual, file of figures in the book, and pseudocode **

## About the Authors

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. He is the recipient of the 2014 Ken Kennedy Award given by the ACM/IEEE Computer Society.

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.

## Endorsements

“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