computer books and technical books at discount prices
Advanced Search
View
My
0
Shopping
Bag
Home Login F.A.Q. Contact Us
 
My Myself and I:
 Order Tracking 
 My Wishlist 
 My Gift Registry 
 Change User Preferences 
 E-mail Notifications 

Browse Books:
 Bestsellers 
 New Arrivals 
 Bargain Computer Books 
 Classic Computer Books 

Browse Subjects:
 business & finance 
 business applications 
 cad/cam 
 certification 
 computing 
 databases 
 desktop publishing 
 engineering 
 gaming 
 geographic/gis 
 graphics/animation 
 groupware 
 internet 
 mathematics 
 microsoft programming 
 multimedia 
 networking 
 object-oriented 
 operating systems 
 other & misc 
 physics 
 programming languages 
 servers 
 web design/development 

The Art of Computer Programming: Generating All Tuples and Permutations, Volume 4, Fascicle 2
by Knuth, Donald E.
 

 
Cover Price: $19.99
Online Price: $13.99
You save $6.00 (30%)

 

ISBN-10: 0201853930
ISBN-13: 9780201853933
Publisher: Addison-Wesley
Published February 2005; Paperback; 127 pages
Add to Shopping Bag
 

IN STOCK
1 COPY
 
Add to Wishlist
Related categories:
All Sections > Engineering > Software Engineering > Algorithms
All Sections > Programming Languages > General/Theory

Summary:

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 2This 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.

0201853930B01252005

Table of Contents:
Chapter 7: Combinatorial Searching 7.2. Generating All Possibilities 17.2.1. Generating Basic Combinatorial Patterns 17.2.1.1. Generating all n-tuples 17.2.1.2. Generating all permutations 39Answers to Exercises 76Index and Glossary 122

Related titles:
Hacker's Delight, 2nd EditionAlgorithm DesignIntroduction to the Design and Analysis of Algorithms, 3rd EditionAlgorithms in a NutshellAlgorithms, 4th EditionFoundations of Multidimensional and Metric Data Structures