Thomas H.Cormen
達特茅斯學院計算機科學係副教授
Charles E.Leiserson
麻省理工學院計算機科學與電氣工程係教授
Ronald L.Rivest
麻省理工學院計算機科學係Andrew與Erna Viterbi具名教授
Clifford Stein
哥倫比亞大學工業工程與運籌學副教授
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.
##描述算法的這種書翻譯一旦有錯誤,或者意思錶達不到位,看起來就很吃力瞭。 第一次看算法導論是看的中文版。我是從頭開始看的,一直看到圖算法結束。讀的時候主要追求速度,不少地方看的不是很明白。然而有些地方我覺得是翻譯的問題導緻理解上的障礙。 china-pub 上有人指齣...
評分 評分 評分 評分##總之很有收獲
評分 評分##You can program for ten years to become a top programmer. Or you can program for two years and take algorithms lessons.
評分本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 book.tinynews.org All Rights Reserved. 静思书屋 版权所有