Introduction to Algorithms, 2/e
暫譯: 演算法導論, 第二版

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

  • 出版商: MIT
  • 出版日期: 2001-09-01
  • 售價: $970
  • 語言: 英文
  • 頁數: 1184
  • 裝訂: Hardcover
  • ISBN: 0262032937
  • ISBN-13: 9780262032933
  • 相關分類: Algorithms-data-structures
  • 無法訂購

買這商品的人也買了...

商品描述

無標題文件 There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms 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 the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

商品描述(中文翻譯)

有關演算法的書籍有些雖然嚴謹但不完整,而另一些則涵蓋大量材料但缺乏嚴謹性。《Introduction to Algorithms》結合了嚴謹性和全面性。

這本書深入探討了廣泛的演算法,並使其設計和分析對所有層次的讀者都能夠理解。每一章相對獨立,可以作為學習單元。演算法以英文和一種設計為任何有過一點程式設計經驗的人都能閱讀的偽程式碼描述。解釋保持在基礎層次,同時不犧牲內容的深度或數學的嚴謹性。

第一版成為專業人士的標準參考書籍,並在全球大學中廣泛使用。第二版新增了有關演算法角色、機率分析和隨機演算法以及線性規劃的新章節,並對書中幾乎每一部分進行了廣泛的修訂。在一個微妙但重要的變化中,循環不變式在早期引入,並在整個文本中用於證明演算法的正確性。在不改變數學和分析重點的情況下,作者將第一部分的許多數學基礎材料移至附錄,並在開頭加入了額外的激勵材料。