The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations

Donald E. Knuth

  • 出版商: Addison-Wesley Professional
  • 出版日期: 2005-02-24
  • 售價: $875
  • 貴賓價: 9.5$831
  • 語言: 英文
  • 頁數: 144
  • 裝訂: Paperback
  • ISBN: 0201853930
  • ISBN-13: 9780201853933
  • 相關分類: R 語言

限量商品 (庫存=10)

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

商品描述

傳送訂單至便利達康

Description:

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.

To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published t regular intervals. Each fascicle will encompass a section or more of wholly new or evised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.

Volume 4, Fascicle 2

This fascicle inaugurates the eagerly awaited publication of Knuth's The Art of Computer Programming, Volume 4: Combinatorial Algorithms. Part of what will be a long chapter on combinatorial searching, the fascicle begins his treatment of how to generate all possibilities. Specifically, it discusses the generation of all n-tuples, then extends those ideas to all permutations. Such algorithms provide a natural motivation by means of which many of the key ideas of combinatorial mathematics can be introduced and explored. In this and other fascicles of Volume 4, Knuth illuminates important theories by discussing related games and puzzles. Even serious programming can be fun.

 

Table of Contents:

Chapter 7: Combinatorial Searching

7.2. Generating All Possibilities 1

7.2.1. Generating Basic Combinatorial Patterns 1

7.2.1.1. Generating all n-tuples 1

7.2.1.2. Generating all permutations 39

Answers to Exercises 76

Index and Glossary 122