This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments.

这本书致力于算法设计的五个主要原则：分而治之、贪婪算法、细化、动态规划和穷举搜索。这些原则是使用Haskell（一种纯粹的函数式语言）提出的，与命令式语言相比，它的解释更简单，程序更短。精心挑选的新示例和标准示例揭示了算法之间的共性，并突出了算法之间的差异。算法开发在适用的情况下使用等式推理，澄清适用条件和正确性参数。