Art of Computer Programming, The: Combinatorial Algorithms, Volume 4A, Part 1, 1st edition

Published by Pearson (September 12, 2014) © 2011

  • Donald E. Knuth
Products list

Title overview

Knuth’s multivolume analysis of algorithms is widely recognised as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marvelled at the beauty and elegance of Knuth’s analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems.

The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer’s library.

The full text downloaded to your computer

With eBooks you can:

  • search for key concepts, words and phrases
  • make highlights and notes as you study
  • share your notes with friends

eBooks are downloaded to your computer and accessible either offline through the Bookshelf (available as a free download), available online and also via the iPad and Android apps.

Upon purchase, you'll gain instant access to this eBook.

Time limit

The eBooks products do not have an expiry date. You will continue to access your digital ebook products whilst you have your Bookshelf installed.

Table of contents

  • Notes on the Exercises
  • Chapter 7: Combinatorial Searching
  • 7.1: Zeros and Ones
  • 7.2: Generating All Possibilities
  • Answers to Exercises
  • Appendix A: Tables of Numerical Quantities
  • Appendix B: Index to Notations
  • Appendix C: Index to Algorithms and Theorems
  • Appendix D: Index to Combinatorial Problems
  • Index and Glossary

Need help?Get in touch