Don't forget to bookmark this web site !!
Used & Out of Print Books | Contact us | Home

Browse and Compare Price at 40+ Sites and 20,000+ Stores!!

|  FAQ/About us |  Recommend us |  Browse |  Memo |  Book Reviews |  Random Quotes |  Help |

 

Find more info., search and price compare for
The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations
by Donald E Knuth
Binding: Paperback, 1 edition, 144 pages
Publisher: Addison-Wesley Professional
Weight: 0.62 pound
Dimension: H: 0.75 x L: 9.37 x W: 0.5 inches
ISBN 10: 0201853930
ISBN 13: 9780201853933
Click here to search for this book and compare price at 40+ bookstores with AddALL.com!

If you cannot find this book in our new and in print search, be sure to try our used and out of print search too!

 

Book 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 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.


|  Home |  FAQ/About us |  Link to us |  Recommend us |  Contact us |  Bookstores |  Memo |

Shipping Destination:
State:
(US only)
Display in:
Search by:

Searching for Out of Print Books? [Click Here]

[ For web hosting, AddALL recommend Liquidweb]