说明：  本册揭开了计算机程序设计艺术目前最长一章的序幕，而论述组合算法的这章将包括完整的3卷。非正式地说，组合算法是对量非常大的对象，如alan或图元素，进行高速处理的技术。组合模式或排列技术可解决大量的现实问题，而处理这些问题的现代方法比起以前所采用的直接过程快上千倍。本册是后面章节的基础，这里首先讨论的是组合学的本质，接着介绍在计算机内部如何有效处理0和1的基本思想，包括布尔基础和布尔求值等内容。并且，为了强化作者的阐述，书中包括了大量细心组织、包括使用说明和详细解答的新的习题。
(The album opened Art of Computer Programming is the longest chapter of the prelude, this chapter discusses the combination algorithm will include the full 3 volumes. Informally, said the combination algorithm is a very large amount of objects, such as alan or diagram elements, high-speed processing technology. Combined mode or arrange to resolve a large number of practical problems, and modern methods to deal with these issues is thousands of times faster than the direct process previously. This volume is the basis of the later chapters, first discussed here is the essence of combinatorics, then introduced inside the computer how to effectively deal with the basic idea of 0 and 1, including the content of the Boolean basis and Boolean value. And, in order to strengthen the elaboration of the author, the book includes a lot of careful organization, including instructions for use and detailed answers to exercises.)