IntroductiontoAlgorithms(3/e)

Introduction to Algorithms is a unique textbook that balances both rigor and comprehensiveness. Unlike other books on this subject, it covers a broad range of algorithms in depth while still being accessible to all levels of readers. Each chapter is self-contained, making it perfect for individual study. Along with English, the algorithms are also presented in a pseudocode that is easy to read for anyone with basic programming experience. Despite the elementary explanations, the book maintains its depth of coverage and mathematical rigor.

Since the first edition, Introduction to Algorithms has become a widely used text in universities worldwide and a standard reference for professionals. The second edition introduced new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has undergone significant revision and updates throughout. It now includes two entirely new chapters on van Emde Boas trees and multithreaded algorithms, as well as substantial additions to the chapter on recurrences (renamed "Divide-and-Conquer"). The treatment of dynamic programming and greedy algorithms has been improved, and a new concept of edge-based flow has been added to the material on flow networks. Finally, many new exercises and problems have been added for this edition.

From the third edition onward, MIT Press exclusively publishes this textbook.

作者简介

ThomasH.Cormen达特茅斯学院计算机科学系副教授CharlesE.Leiserson麻省理工学院计算机科学与电气工程系教授RonaldL.Rivest麻省理工学院计算机科学系Andrew与ErnaViterbi具名教授CliffordStein哥伦比亚大学工业工程与运筹学副教授