具體描述
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.
用戶評價
##總之很有收獲
評分 評分##You can program for ten years to become a top programmer. Or you can program for two years and take algorithms lessons.
評分##我自己花瞭3個月差4天的業餘時間讀瞭大約575頁，最後一個章節 selected topics 略過瞭，後麵的 appendix 也略過瞭，前麵二十六章略過瞭幾個小節，個人覺得無傷大雅的地方。 體會就是，確實不錯。比較注重算法證明和邏輯推導，某種程度上更像是在讀數學教材，但是所需要的數學知...
評分 評分 評分 評分相關圖書
本站所有內容均為互聯網搜尋引擎提供的公開搜索信息，本站不存儲任何數據與內容，任何內容與數據均與本站無關，如有需要請聯繫相關搜索引擎包括但不限於百度，google,bing,sogou 等
© 2025 windowsfront.com All Rights Reserved. 靜流書站 版權所有