The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Paperback) (計算機程式設計的藝術，第4卷，第2冊：生成所有元組和排列)

Donald E. Knuth

The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Paperback)
  • 出版商: Addison Wesley
  • 出版日期: 2005-02-14
  • 售價: $1,150
  • 貴賓價: 9.5 折 $1,093
  • 語言: 英文
  • 頁數: 144
  • 裝訂: Paperback
  • ISBN: 0201853930
  • ISBN-13: 9780201853933
  • 相關分類: R 語言

    • 立即出貨(限量) (庫存=7)

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

相關主題

商品描述

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

商品描述(中文翻譯)

《計算機程式設計藝術》第四卷第二部分

描述：
這部多卷的算法分析作品長期以來一直被認為是經典計算機科學的權威描述。迄今為止已經出版的三卷完整內容已經成為編程理論和實踐中獨特且寶貴的資源。無數讀者談到了Knuth著作對他們的深遠影響。科學家對他的分析的美麗和優雅感到驚嘆，而實踐編程人員則成功地將他的“食譜”解決方案應用於日常問題。所有人都欣賞Knuth在他的書中所展現的廣度、清晰度、準確性和幽默感。

為了開始這套書的第四卷和後續的卷，並更新現有的三卷的部分內容，Knuth創作了一系列稱為fascicles的小書，將定期出版。每個fascicle將包含一個或多個全新或修訂的部分。最終，這些fascicles的內容將被整合到每個卷的全面最終版本中，這項從1962年開始的巨大工程將會完成。

第四卷第二部分
這個fascicle開始了Knuth期待已久的《計算機程式設計藝術第4卷：組合算法》的出版。作為組合搜索的一個長章的一部分，這個fascicle開始了他對如何生成所有可能性的探討。具體而言，它討論了如何生成所有n元組，然後將這些想法擴展到所有排列。這些算法提供了一種自然的動機，可以引入和探索組合數學的許多關鍵思想。在這本書和第四卷的其他fascicles中，Knuth通過討論相關的遊戲和謎題來闡明重要的理論。即使是嚴肅的編程也可以很有趣。

目錄：
第7章：組合搜索
7.2.生成所有可能性 1
7.2.1.生成基本組合模式 1
7.2.1.1.生成所有n元組 1
7.2.1.2.生成所有排列 39

練習答案 76

索引和詞彙表 122

類似商品