算法的圣经，高清pdf格式，迄今版上只有第二版

Introduction to Algorithms, Third Edition 第三版！

２０１１年３月８日更新：本文档已有十来位读者成功下载，关于个别读者反映的”购买后无法打开，该文件已损坏“的情况，我自己进行了下载测试，结果显示文件完整打开完全没有问题，请同学们放心使用！

by: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein 俗称ＣＬＲＳ

year:       2009
pages:       1313
bookmarked:       yes
paginated:       yes
vector:       yes
cover:       yes
searchable:       yes
edition:       3

简介：
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.