Introduction to Algorithms, 3/e (IE-Paperback)

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

  • 出版商: MIT
  • 出版日期: 2009-07-31
  • 售價: $1,590
  • 貴賓價: 9.8$1,558
  • 語言: 英文
  • 頁數: 1312
  • 裝訂: Paperback
  • ISBN: 0262533057
  • ISBN-13: 9780262533058
  • 相關分類: Algorithms-data-structures
  • 其他版本: Introduction to Algorithms, 3/e (Hardcover)
  • 銷售排行: 👍 2018 年度 英文書 銷售排行 第 17 名
    🥈 2018/1 英文書 銷售排行 第 2 名
    🥈 2017 年度 英文書 銷售排行 第 2 名
    🥉 2017/10 英文書 銷售排行 第 3 名
    🥈 2017/9 英文書 銷售排行 第 2 名
    🥉 2017/8 英文書 銷售排行 第 3 名







NOTE: This International Student Edition is not available in the USA or Canada. 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.



註:此國際學生版在美國和加拿大不可用。有些算法書籍嚴謹但不完整,有些則涵蓋大量內容但缺乏嚴謹性。《算法導論》獨特地結合了嚴謹性和全面性。該書深入介紹了廣泛的算法,並使其設計和分析對所有讀者都易於理解。每個章節相對獨立,可作為單獨的學習單元。算法以英文和偽代碼描述,可讀性適合有一些編程經驗的任何人。解釋保持初級水平,同時不牺牲內容的深度和數學嚴謹性。第一版成為全球大學廣泛使用的教材,也是專業人士的標準參考。第二版新增了關於算法的角色、概率分析和隨機算法以及線性規劃的新章節。第三版進行了修訂和更新。新增了兩個全新的章節,分別是van Emde Boas樹和多線程算法,並在關於循環的章節(現在稱為“分治法”)中增加了大量內容。在流網絡的材料中,改進了對動態規劃和貪婪算法的處理,並引入了基於邊的流的新概念。本版新增了許多新的練習和問題。從第三版開始,這本教科書由MIT Press獨家出版。