Introduction to Algorithms, 3rd Edition

丛 书 名：The MIT Press Ser.

版本说明：3rd ed.

作     者：Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein 

I S B N：(纸本) 9780262033848 

出 版 社：The MIT Press 

出 版 年：2009年

页      数：xix, 1292 p. :页

主 题 词：Computer algorithms. Computer programming. 

学科分类：08[工学] 0835[工学-软件工程] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

馆 藏 号：201728521...

摘      要：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 *** 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 *** of the third edition, this textbook is published exclusively by the MIT Press.