Introduction to Algorithms, 2/e

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.

無標題文件

有些算法的書籍嚴謹但不完整，而其他一些則涵蓋大量內容但缺乏嚴謹性。《算法導論》結合了嚴謹性和全面性。

該書深入介紹了廣泛的算法，並使其設計和分析對所有讀者都易於理解。每個章節相對獨立，可以作為單獨的學習單元。算法以英文和偽代碼描述，設計成可讀性強，適合有一些編程經驗的人閱讀。解釋保持了初學者友好，同時不減少內容的深度和數學嚴謹性。

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