What Do You Need to Know to Do Knuths Art of Computer Programming

Books almost algorithms by Donald Knuth

The Art of Computer Programming

The Fine art of Reckoner Programming, Volume i: Fundamental Algorithms
Author	Donald Knuth
Country	United States
Language	English
Genre	Not-fiction Monograph
Publisher	Addison-Wesley
Publication date	1968– (the book is nevertheless incomplete)
Media type	Impress (Hardcover)
ISBN	0-201-03801-iii
Dewey Decimal	519
LC Class	QA76.75

The Art of Computer Programming ( TAOCP ) is a comprehensive monograph written past the computer scientist Donald Knuth presenting programming algorithms and their assay.

Knuth began the projection, originally conceived as a single book with twelve chapters, in 1962. The kickoff 3 volumes of what was then expected to be a 7-volume prepare were published in 1968, 1969, and 1973. Piece of work began in earnest on Volume 4 in 1973, merely was suspended in 1977 for piece of work on typesetting prompted by the 2d edition of Volume 2. Writing of the concluding copy of Volume 4A began in longhand in 2001, and the commencement online pre-fascicle, 2A, appeared subsequently in 2001.^[1] The kickoff published installment of Book 4 appeared in paperback as Fascicle 2 in 2005. The hardback Book 4A, combining Book 4, Fascicles 0–4, was published in 2011. Volume four, Fascicle 6 ("Satisfiability") was released in December 2015; Volume 4, Fascicle 5 ("Mathematical Preliminaries Redux; Backtracking; Dancing Links") was released in November 2019.

The published Fascicles v and 6 are expected to make upward the first two-thirds of Volume 4B. Knuth has not announced any estimated date for release of Volume 4B, although his method used for Volume 4A is to release the hardback volume sometime after release of the paperback fascicles contained in information technology. Near-term publisher estimates put the release date at May or June 2019, which proved to be incorrect.^{[two] [3]}

History [edit]

Afterward winning a Westinghouse Talent Search scholarship, Knuth enrolled at the Case Institute of Applied science (now Case Western Reserve University), where his operation was so outstanding that the faculty voted to laurels him a master of science upon his completion of the available degree. During his summer vacations, Knuth was hired by the Burroughs Corporation to write compilers, earning more in his summer months than full professors did for an entire year.^[iv] Such exploits made Knuth a topic of discussion among the mathematics section, which included Richard S. Varga.

In January 1962, when he was a graduate student in the mathematics section at Caltech, Knuth was approached by Addison-Wesley to write a volume about compiler design, and he proposed a larger telescopic. He came up with a list of 12 chapter titles the aforementioned day. In the summer of 1962 he worked on a FORTRAN compiler for UNIVAC. During this time, he too came up with a mathematical analysis of linear probing, which convinced him to present the fabric with a quantitative approach. After receiving his PhD in June 1963, he began working on his manuscript, of which he finished his first draft in June 1965, at 3000 hand-written pages.^[5] He had assumed that about five hand-written pages would translate into one printed folio, simply his publisher said instead that nearly ane+ 1⁄2 manus-written pages translated to ane printed page. This meant he had approximately 2000 printed pages of material, which closely matches the size of the get-go three published volumes. The publisher was nervous about accepting such a project from a graduate student. At this point, Knuth received support from Richard S. Varga, who was the scientific adviser to the publisher. Varga was visiting Olga Taussky-Todd and John Todd at Caltech. With Varga'south enthusiastic endorsement, the publisher accepted Knuth's expanded plans. In its expanded version, the volume would be published in seven volumes, each with just one or two chapters.^[half-dozen] Due to the growth in Chapter seven, which was fewer than 100 pages of the 1965 manuscript, per Vol. 4A p. vi, the program for Volume 4 has since expanded to include Volumes 4A, 4B, 4C, 4D, and possibly more.

In 1976, Knuth prepared a second edition of Volume 2, requiring it to be typeset once more, just the manner of blazon used in the first edition (chosen hot blazon) was no longer available. In 1977, he decided to spend some time creating something more suitable. Eight years later, he returned with T_E10, which is currently used for all volumes.

The offer of a so-called Knuth reward check worth "one hexadecimal dollar" (100_HEX base 16 cents, in decimal, is $2.56) for whatsoever errors constitute, and the correction of these errors in subsequent printings, has contributed to the highly polished and still-authoritative nature of the piece of work, long afterward its outset publication. Some other characteristic of the volumes is the variation in the difficulty of the exercises. Knuth even has a numerical difficulty calibration for rating those exercises, varying from 0 to l, where 0 is piddling, and l is an open question in contemporary inquiry.^[7]

Knuth'southward dedication reads:

This series of books is affectionately dedicated
to the Type 650 computer one time installed at
Case Institute of Technology,
with whom I accept spent many pleasant evenings.^[a]

Associates linguistic communication in the volume [edit]

All examples in the books use a language called "MIX assembly language", which runs on the hypothetical MIX calculator. Currently, the MIX figurer is beingness replaced by the MMIX computer, which is a RISC version. Software such as GNU MDK exists to provide emulation of the MIX architecture. Knuth considers the utilise of assembly language necessary for the speed and retention usage of algorithms to be judged.

Critical response [edit]

Knuth was awarded the 1974 Turing Award "for his major contributions to the analysis of algorithms […], and in particular for his contributions to the 'art of reckoner programming' through his well-known books in a continuous series by this title."^[8] American Scientist has included this work among "100 or and then Books that shaped a Century of Scientific discipline", referring to the twentieth century,^[9] and within the computer science community it is regarded as the first and still the all-time comprehensive treatment of its subject area. ^{[ failed verification ]} Covers of the 3rd edition of Volume i quote Bill Gates as saying, "If yous think you're a really good programmer… read (Knuth's) Art of Computer Programming… You should definitely send me a résumé if you can read the whole affair."^[ten] The New York Times referred to it as "the profession'southward defining treatise".^[11]

Volumes [edit]

Completed [edit]

• Volume 1 – Fundamental Algorithms
  • Chapter 1 – Basic concepts
  • Chapter 2 – Information structures
• Book 2 – Seminumerical Algorithms
  • Chapter 3 – Random numbers
  • Chapter 4 – Arithmetic
• Volume 3 – Sorting and Searching
  • Chapter 5 – Sorting
  • Chapter 6 – Searching
• Volume 4A – Combinatorial Algorithms
  • Chapter vii – Combinatorial searching (function ane)

Planned [edit]

• Volume 4B... – Combinatorial Algorithms (capacity seven & eight released in several subvolumes)
  • Chapter 7 – Combinatorial searching (continued)
  • Chapter 8 – Recursion
• Volume 5 – Syntactic Algorithms
  • Chapter 9 – Lexical scanning (also includes string search and data compression)
  • Chapter 10 – Parsing techniques
• Volume 6 – The Theory of Context-Free Languages
• Book 7 – Compiler Techniques

Chapter outlines [edit]

Completed [edit]

Volume 1 – Fundamental Algorithms [edit]

• Chapter 1 – Basic concepts
  • one.1. Algorithms
  • 1.two. Mathematical Preliminaries
    • i.2.1. Mathematical Induction
    • 1.two.ii. Numbers, Powers, and Logarithms
    • 1.2.3. Sums and Products
    • 1.2.4. Integer Functions and Uncomplicated Number Theory
    • i.2.v. Permutations and Factorials
    • 1.2.6. Binomial Coefficients
    • 1.2.7. Harmonic Numbers
    • 1.2.eight. Fibonacci Numbers
    • i.2.9. Generating Functions
    • one.ii.10. Assay of an Algorithm
    • 1.2.11. Asymptotic Representations
      • 1.ii.11.one. The O-notation
      • 1.2.11.2. Euler's summation formula
      • one.2.xi.three. Some asymptotic calculations
  • 1.3 MMIX (MIX in the hardback re-create but updated past fascicle 1)
    • 1.iii.1. Description of MMIX
    • ane.3.2. The MMIX Assembly Language
    • i.3.3. Applications to Permutations
  • 1.four. Some Key Programming Techniques
    • ane.4.1. Subroutines
    • 1.4.2. Coroutines
    • i.iv.iii. Interpretive Routines
      • one.iv.3.i. A MIX simulator
      • 1.4.3.2. Trace routines
    • 1.4.four. Input and Output
    • 1.four.v. History and Bibliography
• Chapter 2 – Information Structures
  • 2.ane. Introduction
  • 2.2. Linear Lists
    • 2.ii.1. Stacks, Queues, and Deques
    • 2.2.2. Sequential Allocation
    • 2.2.3. Linked Allotment (topological sorting)
    • two.two.4. Round Lists
    • 2.2.5. Doubly Linked Lists
    • 2.two.6. Arrays and Orthogonal Lists
  • 2.3. Copse
    • 2.3.1. Traversing Binary Trees
    • 2.iii.2. Binary Tree Representation of Trees
    • two.iii.3. Other Representations of Trees
    • 2.iii.4. Bones Mathematical Backdrop of Trees
      • ii.3.4.1. Free trees
      • two.three.4.2. Oriented trees
      • 2.3.4.three. The "infinity lemma"
      • ii.three.4.4. Enumeration of trees
      • 2.3.four.v. Path length
      • 2.3.4.half-dozen. History and bibliography
    • 2.3.5. Lists and Garbage Drove
  • two.4. Multilinked Structures
  • ii.5. Dynamic Storage Allocation
  • 2.6. History and Bibliography

Volume ii – Seminumerical Algorithms [edit]

• Chapter 3 – Random Numbers
  • 3.1. Introduction
  • three.2. Generating Compatible Random Numbers
    • 3.2.1. The Linear Congruential Method
      • iii.2.1.1. Option of modulus
      • 3.ii.1.ii. Pick of multiplier
      • three.2.1.3. Authority
    • iii.2.ii. Other Methods
  • iii.3. Statistical Tests
    • 3.three.i. General Test Procedures for Studying Random Information
    • three.3.ii. Empirical Tests
    • 3.iii.3. Theoretical Tests
    • 3.3.four. The Spectral Test
  • 3.4. Other Types of Random Quantities
    • three.4.1. Numerical Distributions
    • 3.4.2. Random Sampling and Shuffling
  • 3.five. What Is a Random Sequence?
  • 3.half dozen. Summary
• Chapter iv – Arithmetic
  • 4.1. Positional Number Systems
  • 4.2. Floating Signal Arithmetics
    • four.2.ane. Single-Precision Calculations
    • four.ii.two. Accuracy of Floating Point Arithmetic
    • 4.ii.3. Double-Precision Calculations
    • iv.ii.four. Distribution of Floating Signal Numbers
  • 4.3. Multiple Precision Arithmetic
    • 4.iii.i. The Classical Algorithms
    • iv.3.2. Modular Arithmetic
    • 4.3.3. How Fast Can We Multiply?
  • iv.4. Radix Conversion
  • 4.5. Rational Arithmetic
    • 4.5.1. Fractions
    • four.five.2. The Greatest Common Divisor
    • 4.v.3. Assay of Euclid'south Algorithm
    • 4.five.4. Factoring into Primes
  • 4.six. Polynomial Arithmetic
    • 4.half-dozen.1. Sectionalization of Polynomials
    • four.half-dozen.2. Factorization of Polynomials
    • 4.6.3. Evaluation of Powers (addition-chain exponentiation)
    • 4.half-dozen.iv. Evaluation of Polynomials
  • 4.7. Manipulation of Power Series

Volume 3 – Sorting and Searching [edit]

• Chapter 5 – Sorting
  • 5.ane. Combinatorial Backdrop of Permutations
    • v.1.1. Inversions
    • 5.1.2. Permutations of a Multiset
    • 5.ane.3. Runs
    • 5.one.4. Tableaux and Involutions
  • 5.2. Internal sorting
    • 5.2.one. Sorting by Insertion
    • five.ii.2. Sorting by Exchanging
    • v.2.iii. Sorting by Selection
    • 5.ii.iv. Sorting by Merging
    • five.two.5. Sorting by Distribution
  • five.3. Optimum Sorting
    • 5.3.1. Minimum-Comparing Sorting
    • 5.3.ii. Minimum-Comparison Merging
    • v.iii.three. Minimum-Comparing Option
    • five.iii.4. Networks for Sorting
  • 5.4. External Sorting
    • five.four.i. Multiway Merging and Replacement Selection
    • 5.4.2. The Polyphase Merge
    • 5.4.3. The Cascade Merge
    • 5.four.4. Reading Tape Backwards
    • 5.4.5. The Oscillating Sort
    • 5.4.six. Practical Considerations for Tape Merging
    • 5.4.7. External Radix Sorting
    • 5.four.8. Two-Tape Sorting
    • 5.4.9. Disks and Drums
  • 5.5. Summary, History, and Bibliography
• Affiliate half dozen – Searching
  • half dozen.ane. Sequential Searching
  • vi.2. Searching by Comparison of Keys
    • six.2.1. Searching an Ordered Table
    • 6.2.2. Binary Tree Searching
    • 6.2.3. Counterbalanced Copse
    • 6.2.4. Multiway Trees
  • 6.three. Digital Searching
  • six.4. Hashing
  • 6.5. Retrieval on Secondary Keys

Volume 4A – Combinatorial Algorithms, Part 1 [edit]

• Affiliate vii – Combinatorial Searching
  • 7.one. Zeros and Ones
    • 7.1.1. Boolean Basics
    • seven.one.ii. Boolean Evaluation
    • 7.one.iii. Bitwise Tricks and Techniques
    • seven.1.iv. Binary Conclusion Diagrams
  • 7.2. Generating All Possibilities
    • 7.two.1. Generating Bones Combinatorial Patterns
      • seven.ii.1.i. Generating all n-tuples
      • 7.2.1.ii. Generating all permutations
      • 7.two.1.3. Generating all combinations
      • 7.two.1.4. Generating all partitions
      • seven.ii.one.5. Generating all set partitions
      • 7.two.1.6. Generating all trees
      • 7.2.ane.seven. History and further references

Planned [edit]

Volume 4B, 4C, 4D – Combinatorial Algorithms [edit]

• Chapter vii – Combinatorial Searching (continued)
  • 7.2. Generating all possibilities (connected)
    • 7.2.ii. Backtrack programming (published in Fascicle v)
      • vii.2.ii.1. Dancing links (published in Fascicle 5)
      • 7.2.ii.2. Satisfiability (published in Fascicle 6)
      • 7.2.2.3. Constraint satisfaction
      • seven.2.2.4. Hamiltonian paths and cycles (online draft in pre-fascicle 8A)
      • seven.2.ii.5. Cliques
      • 7.ii.two.6. Covers (Vertex cover, Set cover problem, Exact cover, Clique encompass)
      • vii.2.ii.vii. Squares
      • 7.2.2.viii. A potpourri of puzzles (online draft in pre-fascicle 9B) (includes Perfect digital invariant)
      • 7.2.two.9. Estimating backtrack costs (affiliate 6 of "Selected Papers on Analysis of Algorithms", and Fascicle 5, pp 44−47, under the heading "Running fourth dimension estimates")
    • 7.ii.3. Generating inequivalent patterns (includes give-and-take of Pólya enumeration theorem) (come across "Techniques for Isomorph Rejection", Ch four of "Classification Algorithms for Codes and Designs" by Kaski and Östergård)
  • 7.iii. Shortest paths
  • 7.four. Graph algorithms
    • seven.4.1. Components and traversal
      • seven.iv.1.ane. Union-find algorithms
      • seven.4.1.2. Depth-first search
      • 7.4.one.iii. Vertex and border connectivity
    • 7.4.2. Special classes of graphs
    • 7.iv.3. Expander graphs
    • vii.4.4. Random graphs
  • 7.5. Graphs and optimization
    • 7.5.ane. Bipartite matching (including maximum-cardinality matching, Stable marriage problem, Mariages Stables)
    • 7.v.2. The consignment problem
    • 7.five.three. Network flows
    • 7.5.4. Optimum subtrees
    • seven.5.5. Optimum matching
    • 7.v.6. Optimum orderings
  • 7.half dozen. Independence theory
    • vii.6.1. Independence structures
    • 7.6.2. Efficient matroid algorithms
  • vii.seven. Detached dynamic programming (run into besides Transfer-matrix method)
  • 7.eight. Branch-and-bound techniques
  • seven.9. Herculean tasks (aka NP-hard problems)
  • seven.10. About-optimization
• Affiliate 8 – Recursion (affiliate 22 of "Selected Papers on Analysis of Algorithms")

Volume v – Syntactic Algorithms [edit]

• Chapter 9 – Lexical scanning (includes as well cord search and data compression)
• Affiliate ten – Parsing techniques

Volume 6 – The Theory of Context-costless Languages^[12] [edit]

Book vii – Compiler Techniques [edit]

English editions [edit]

Current editions [edit]

These are the electric current editions in order past book number:

• The Art of Computer Programming, Volumes ane-4A Boxed Set. Third Edition (Reading, Massachusetts: Addison-Wesley, 2011), 3168pp. ISBN 978-0-321-75104-1, 0-321-75104-3
  • Book one: Fundamental Algorithms. Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xx+650pp. ISBN 978-0-201-89683-1, 0-201-89683-4. Errata: [1] (2011-01-08), [ii] (2020-03-26, 27th press). Addenda: [3] (2011).
  • Volume two: Seminumerical Algorithms. 3rd Edition (Reading, Massachusetts: Addison-Wesley, 1997), xiv+762pp. ISBN 978-0-201-89684-viii, 0-201-89684-2. Errata: [4] (2011-01-08), [5] (2020-03-26, 26th printing). Addenda: [half-dozen] (2011).
  • Volume 3: Sorting and Searching. 2d Edition (Reading, Massachusetts: Addison-Wesley, 1998), xiv+780pp.+foldout. ISBN 978-0-201-89685-5, 0-201-89685-0. Errata: [7] (2011-01-08), [8] (2020-03-26, 27th printing). Addenda: [9] (2011).
  • Volume 4A: Combinatorial Algorithms, Part 1. Showtime Edition (Reading, Massachusetts: Addison-Wesley, 2011), fifteen+883pp. ISBN 978-0-201-03804-0, 0-201-03804-8. Errata: [10] (2020-03-26, ? printing).
• Volume 1, Fascicle 1: MMIX – A RISC Computer for the New Millennium. (Addison-Wesley, 2005-02-14) ISBN 0-201-85392-two. Errata: [eleven] (2020-03-16) (will be in the 4th edition of volume 1)
• Volume iv, Fascicle 5: Mathematical Preliminaries Redux; Backtracking; Dancing Links. (Addison-Wesley, 2019-eleven-22) thirteen+382pp, ISBN 978-0-13-467179-six. Errata: [12] (2020-03-27) (volition become part of book 4B)
• Volume 4, Fascicle 6: Satisfiability. (Addison-Wesley, 2015-12-08) xiii+310pp, ISBN 978-0-thirteen-439760-iii. Errata: [13] (2020-03-26) (will go part of volume 4B)

Previous editions [edit]

Complete volumes [edit]

These volumes were superseded past newer editions and are in social club by date.

• Book 1: Fundamental Algorithms. Offset edition, 1968, xxi+634pp, ISBN 0-201-03801-3.^[13]
• Book 2: Seminumerical Algorithms. Kickoff edition, 1969, eleven+624pp, ISBN 0-201-03802-1.^[xiii]
• Volume 3: Sorting and Searching. Start edition, 1973, xi+723pp+foldout, ISBN 0-201-03803-Ten. Errata: [14].
• Volume i: Fundamental Algorithms. Second edition, 1973, xxi+634pp, ISBN 0-201-03809-9. Errata: [15].
• Volume ii: Seminumerical Algorithms. Second edition, 1981, thirteen+ 688pp, ISBN 0-201-03822-6. Errata: [16].
• The Art of Calculator Programming, Volumes i-3 Boxed Ready. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), pp. ISBN 978-0-201-48541-7, 0-201-48541-ix

Fascicles [edit]

Volume 4's fascicles 0–4 were revised and published equally Volume 4A:

• Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions. (Addison-Wesley Professional, 2008-04-28) vi+240pp, ISBN 0-321-53496-4. Errata: [17] (2011-01-01).
• Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams. (Addison-Wesley Professional, 2009-03-27) viii+260pp, ISBN 0-321-58050-viii. Errata: [eighteen] (2011-01-01).
• Volume 4, Fascicle 2: Generating All Tuples and Permutations. (Addison-Wesley, 2005-02-xiv) 5+127pp, ISBN 0-201-85393-0. Errata: [nineteen] (2011-01-01).
• Volume 4, Fascicle 3: Generating All Combinations and Partitions. (Addison-Wesley, 2005-07-26) half dozen+150pp, ISBN 0-201-85394-9. Errata: [20] (2011-01-01).
• Volume 4, Fascicle 4: Generating All Trees; History of Combinatorial Generation. (Addison-Wesley, 2006-02-06) six+120pp, ISBN 0-321-33570-8. Errata: [21] (2011-01-01).

Volume iv's fascicles five–6 will go part of Book 4B:

• Volume 4, Fascicle v: Mathematical Preliminaries Redux; Backtracking; Dancing Links. (Addison-Wesley, 2019-11-22) xiii+382pp, ISBN 978-0-13-467179-six. Errata: [22] (2020-03-27)
• Volume iv, Fascicle half-dozen: Satisfiability. (Addison-Wesley, 2015-12-08) xiii+310pp, ISBN 978-0-13-439760-3. Errata: [23] (2020-03-26)

Pre-fascicles [edit]

Book four's pre-fascicles 5A, 5B, and 5C were revised and published every bit fascicle 5.

Book 4's pre-fascicle 6A was revised and published every bit fascicle 6.

• Volume 4, Pre-fascicle 8A: Hamiltonian Paths and Cycles
• Volume 4, Pre-fascicle 9B: A Potpourri of Puzzles

Encounter too [edit]

• Introduction to Algorithms

References [edit]

Notes

1. ^ The dedication was worded slightly differently in the outset edition.

Citations

1. ^ "note for box 3, binder one".
2. ^ "Addison-Wesley Pearson webpage".
3. ^ "Pearson Educational".
4. ^ Frana, Philip L. (2001-eleven-08). "An Interview with Donald E. Knuth". hdl:11299/107413.
5. ^ Donald Knuth, This Week's Citation Classic, Current Contents, Number 34 (Baronial 23, 1993), folio viii.
6. ^ Albers, Donald J. (2008). "Donald Knuth". In Albers, Donald J.; Alexanderson, Gerald L. (eds.). Mathematical People: Profiles and Interviews (2 ed.). A K Peters. ISBN978-i-56881-340-0.
7. ^ "Reflections on a year of reading Knuth". infinitepartitions.com . Retrieved 2020-07-25 . I worked, or at least attempted to work, every single problem in the first volume. In some cases I settled for just understanding what the question was trying to ask for. In some cases I failed even to accomplish that (don't judge me until you try it yourself). Each problem is assigned a difficulty rating from 0-50 where 0 is trivial and 50 is "unsolved research problem" (in the first edition, Fermat's final theorem was listed equally a 50, but since Andrew Wiles proved it, information technology's bumped downwardly to a 45 in the electric current edition). I think I was able to solve most of the problems rated < xx — it was hit and miss beyond that. Most of the problems fell into the xx-30 difficulty range, but Knuth's idea of "hard" is subjective, and bug that he considers to be of boilerplate difficulty ended up stretching my comparatively tiny brain painfully. I've never climbed Mount Everest, but I imagine the whole ordeal feels similar: painful while yous're going through it, but triumphant when you reach the top.
8. ^ "Donald E. Knuth – A. Thousand. Turing Award Winner". AM Turing . Retrieved 2017-01-25 .
9. ^ Morrison, Philip; Morrison, Phylis (November–December 1999). "100 or then Books that shaped a Century of Science". American Scientist. Sigma Xi, The Scientific Inquiry Society. 87 (half-dozen). Archived from the original on 2008-08-20. Retrieved 2008-01-xi .
10. ^ Weinberger, Matt. "Neb Gates once said 'definitely send me a résumé' if you finish this fiendishly difficult book". Business Insider . Retrieved 2016-06-13 .
11. ^ Lohr, Steve (2001-12-17). "Frances E. Holberton, 84, Early Computer Programmer". The New York Times . Retrieved 2010-05-17 .
12. ^ "TAOCP – Future plans".
13. ^ ^{a b} Wells, Marking B. (1973). "Review: The Art of Computer Programming, Volume 1. Cardinal Algorithms and Volume 2. Seminumerical Algorithms by Donald Eastward. Knuth" (PDF). Bulletin of the American Mathematical Society. 79 (three): 501–509. doi:10.1090/s0002-9904-1973-13173-8.

Sources

• Slater, Robert (1987). Portraits in Silicon. MIT Press. ISBN0-262-19262-4.
• Shasha, Dennis; Lazere, Cathy (1995). Out of Their Minds: The Lives and Discoveries of xv Slap-up Computer Scientists . Copernicus. ISBN0-387-97992-ane.

External links [edit]

• Overview of topics (Knuth's personal homepage)
• Oral history interview with Donald Eastward. Knuth at Charles Babbage Institute, Academy of Minnesota, Minneapolis. Knuth discusses software patenting, structured programming, collaboration and his development of TeX. The oral history discusses the writing of The Art of Figurer Programming.
• "Robert West Floyd, In Memoriam", by Donald E. Knuth - (on the influence of Bob Floyd)
• TAoCP and its Influence of Computer Science (Softpanorama)

alexanderyoulthad95.blogspot.com

Source: https://en.wikipedia.org/wiki/The_Art_of_Computer_Programming