《Introduction to Algorithms, fourth edition》简介：

A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout.

New for the fourth edition

• New chapters on matchings in bipartite graphs, online algorithms, and machine learning

• New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays

• 140 new exercises and 22 new problems

• Reader feedback–informed improvements to old problems

• Clearer, more personal, and gender-neutral writing style

• Color added to improve visual presentation

• Notes, bibliography, and index updated to reflect developments in the field

• Website with new supplementary material

《Introduction to Algorithms, fourth edition》摘录：

动态规划算法的设计可以分为如下四个步骤： 1 描述最优解的结构。 2 递归定义最优解的值。 3 按自底向上的方式计算最优解的值。 4 由计算出的结果构造一个最优解。