Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.
The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e
ISBN: 0321751043
Art of Computer Programming, Volume 4, Fascicle 2, The: Generating All Tuples and Permutations: Generating All Tuples and Permutations
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.
Les mer
Part of a multivolume work on the analysis of algorithms, this title deals with combinatorial searching. Specifically, it discusses the generation of n-tuples, then extends those ideas to permutations. Such algorithms provide a natural motivation by means of which many of the key ideas of combinatorial mathematics can be introduced and explored.
Les mer
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
Les mer
According to Webster's Dictionary, a fascicle is "one of the division of a bookpublished in parts."This material represents a first look at material from the long-anticipated andmuch-discussed Volume 4 of Donald Knuth's The Art of ComputerProgramming.Knuth's fascicle philosophy is as follows: "The material will first appear in betatestform as fascicles of approximately 128 pages each, issued approximatelytwice per year. These fascicles will represent my best attempt to write acomprehensive account, but computer science has grown to the point where Icannot hope to be an authority on all the material covered in these books.Therefore I'll need feedback from readers in order to prepare the officialvolumes later."
Les mer
Produktdetaljer
ISBN
9780201853933
Publisert
2005-03-03
Utgiver
Pearson Education Limited
Vekt
270 gr
Høyde
241 mm
Bredde
163 mm
Dybde
11 mm
Aldersnivå
05, U
Språk
Product language
Engelsk
Format
Product format
Heftet
Antall sider
144
Forfatter
Serien redigert av