具體描述
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.
用戶評價
##剛開始看，覺得講得很清楚。
評分##讀瞭個大概
評分##太長瞭。看過之後也動不瞭手。不適閤自學，還是當字典吧
評分雖然僞代碼寫得很惡心，但是永恒經典，白天可避孕，晚上可防身。另外，中文翻譯一定是體育老師。
評分##總之很有收獲
評分##在stanford上瞭cs161這本是必讀書目
評分##沒看完。
評分##Basic. Classic
評分##總之很有收獲
