Computer Programming Art (Volume 4, Book 2, Bilingual Edition)

Author: Knuth
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. 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.