Author: (USA) Donald Knuth
Translator: Su Yunlin / Country: United States
Publisher:
Publish Date: 2006-07-01
Features: This multi-volume work on algorithm analysis has long been recognized as a definitive description of classic computer science. As part of a lengthy chapter on combinatorial searching, this volume begins with a discussion on how to generate all possible combinations. Specifically, it discusses the generation of all n-tuples and then extends these ideas to permutations. Such algorithms provide a natural introduction through which many key concepts of combinatorial mathematics can be introduced and explored.
Computer Programming Art, Volume 4, Issue 2: Generating All Tuples and Permutations (Bilingual Edition)
📌 Related Posts
Literature
Vitamin Encyclopedia
2026-09-21
Literature
English version of AutoCAD 2005 Practical Training Course
2026-09-26
Literature
Machine Operator Techniques and Tips
2026-09-28
Literature
The fall of the country in the Gengzi year
2026-10-03
Literature
Battle of the Bulge: The First 24 Hours (Includes CD-ROM)
2026-10-05
Literature
Enterprise informatization management and application
2026-10-05
Literature
Theory of Distribution of Intellectual Capital Returns
2026-10-05
Literature
World Economics - Principles and Methods
2026-10-05