The Art of Computer Programming Volume 3 2nd Ed Sorting and Searching

Books almost algorithms by Donald Knuth

The Art of Reckoner Programming

The Art of Figurer Programming, Book 1: Key Algorithms
Author	Donald Knuth
Country	United States
Language	English
Genre	Non-fiction Monograph
Publisher	Addison-Wesley
Publication engagement	1968– (the book is still incomplete)
Media type	Print (Hardcover)
ISBN	0-201-03801-three
Dewey Decimal	519
LC Class	QA76.75

The Fine art of Estimator Programming ( TAOCP ) is a comprehensive monograph written by the computer scientist Donald Knuth presenting programming algorithms and their assay.

Knuth began the project, originally conceived every bit a single book with twelve chapters, in 1962. The first three volumes of what was and so expected to exist a seven-volume set were published in 1968, 1969, and 1973. Work began in earnest on Book four in 1973, just was suspended in 1977 for work on typesetting prompted past the second edition of Book 2. Writing of the final copy of Book 4A began in longhand in 2001, and the showtime online pre-fascicle, 2A, appeared later on in 2001.^[1] The outset published installment of Volume 4 appeared in paperback as Fascicle 2 in 2005. The hardback Volume 4A, combining Volume 4, Fascicles 0–4, was published in 2011. Volume four, Fascicle vi ("Satisfiability") was released in December 2015; Volume iv, Fascicle 5 ("Mathematical Preliminaries Redux; Backtracking; Dancing Links") was released in November 2019.

The published Fascicles 5 and 6 are expected to make upward the first 2-thirds of Volume 4B. Knuth has not announced any estimated date for release of Volume 4B, although his method used for Book 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 wrong.^{[two] [3]}

History [edit]

After winning a Westinghouse Talent Search scholarship, Knuth enrolled at the Case Establish of Technology (now Case Western Reserve Academy), where his performance was so outstanding that the faculty voted to laurels him a master of science upon his completion of the bachelor degree. During his summer vacations, Knuth was hired past the Burroughs Corporation to write compilers, earning more than in his summer months than total professors did for an entire year.^[four] Such exploits made Knuth a topic of discussion amongst the mathematics section, which included Richard S. Varga.

In January 1962, when he was a graduate student in the mathematics department at Caltech, Knuth was approached by Addison-Wesley to write a volume about compiler design, and he proposed a larger scope. He came up with a list of 12 chapter titles the same day. In the summertime of 1962 he worked on a FORTRAN compiler for UNIVAC. During this fourth dimension, he also came up with a mathematical analysis of linear probing, which convinced him to present the cloth with a quantitative arroyo. After receiving his PhD in June 1963, he began working on his manuscript, of which he finished his first typhoon 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 about 1+ 1⁄2 hand-written pages translated to one printed page. This meant he had approximately 2000 printed pages of material, which closely matches the size of the start three published volumes. The publisher was nervous about accepting such a projection from a graduate educatee. 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's enthusiastic endorsement, the publisher accustomed Knuth's expanded plans. In its expanded version, the book would be published in 7 volumes, each with just one or ii capacity.^[6] Due to the growth in Chapter 7, which was fewer than 100 pages of the 1965 manuscript, per Vol. 4A p. vi, the plan for Volume 4 has since expanded to include Volumes 4A, 4B, 4C, 4D, and peradventure more.

In 1976, Knuth prepared a 2nd edition of Volume 2, requiring information technology to be typeset over again, just the mode of blazon used in the first edition (called hot type) was no longer available. In 1977, he decided to spend some time creating something more suitable. Eight years later, he returned with T_{Due east}X, which is currently used for all volumes.

The offer of a so-called Knuth reward bank check worth "1 hexadecimal dollar" (100_HEX base 16 cents, in decimal, is $2.56) for whatsoever errors institute, and the correction of these errors in subsequent printings, has contributed to the highly polished and withal-authoritative nature of the piece of work, long after its first publication. Another feature of the volumes is the variation in the difficulty of the exercises. Knuth even has a numerical difficulty scale for rating those exercises, varying from 0 to 50, where 0 is trivial, and l is an open up question in contemporary enquiry.^[seven]

Knuth's dedication reads:

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

Assembly language in the book [edit]

All examples in the books employ a linguistic communication called "MIX assembly linguistic communication", which runs on the hypothetical MIX computer. Currently, the MIX computer is being 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 use of assembly linguistic communication necessary for the speed and memory usage of algorithms to be judged.

Disquisitional 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 'fine art of computer programming' through his well-known books in a continuous series by this title."^[8] American Scientist has included this work among "100 or so Books that shaped a Century of Scientific discipline", referring to the twentieth century,^[9] and inside the information science community it is regarded every bit the outset and still the best comprehensive treatment of its bailiwick. ^{[ failed verification ]} Covers of the third edition of Volume 1 quote Bill Gates equally saying, "If you retrieve you're a really practiced programmer… read (Knuth's) Art of Computer Programming… You should definitely send me a résumé if yous tin read the whole thing."^[ten] The New York Times referred to information technology as "the profession's defining treatise".^[11]

Volumes [edit]

Completed [edit]

• Volume 1 – Fundamental Algorithms
  • Affiliate 1 – Basic concepts
  • Chapter 2 – Data structures
• Volume two – Seminumerical Algorithms
  • Chapter 3 – Random numbers
  • Chapter 4 – Arithmetic
• Book 3 – Sorting and Searching
  • Chapter v – Sorting
  • Chapter 6 – Searching
• Volume 4A – Combinatorial Algorithms
  • Chapter seven – Combinatorial searching (role 1)

Planned [edit]

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

Affiliate outlines [edit]

Completed [edit]

Volume one – Fundamental Algorithms [edit]

• Affiliate ane – Basic concepts
  • 1.1. Algorithms
  • 1.2. Mathematical Preliminaries
    • i.ii.ane. Mathematical Consecration
    • 1.ii.two. Numbers, Powers, and Logarithms
    • one.2.3. Sums and Products
    • 1.two.4. Integer Functions and Unproblematic Number Theory
    • i.ii.5. Permutations and Factorials
    • 1.two.half dozen. Binomial Coefficients
    • 1.two.vii. Harmonic Numbers
    • 1.2.8. Fibonacci Numbers
    • 1.ii.9. Generating Functions
    • i.2.x. Analysis of an Algorithm
    • one.2.xi. Asymptotic Representations
      • one.2.11.1. The O-notation
      • 1.2.11.two. Euler'southward summation formula
      • i.2.11.iii. Some asymptotic calculations
  • 1.3 MMIX (MIX in the hardback copy only updated by fascicle ane)
    • 1.3.one. Description of MMIX
    • 1.3.2. The MMIX Assembly Language
    • 1.3.iii. Applications to Permutations
  • 1.4. Some Fundamental Programming Techniques
    • 1.four.i. Subroutines
    • 1.4.2. Coroutines
    • i.four.3. Interpretive Routines
      • 1.4.3.1. A MIX simulator
      • 1.iv.three.ii. Trace routines
    • one.4.4. Input and Output
    • one.4.5. History and Bibliography
• Chapter ii – Information Structures
  • 2.i. Introduction
  • ii.2. Linear Lists
    • two.2.1. Stacks, Queues, and Deques
    • two.2.2. Sequential Allocation
    • 2.2.3. Linked Allocation (topological sorting)
    • 2.two.iv. Circular Lists
    • 2.ii.5. Doubly Linked Lists
    • 2.2.half-dozen. Arrays and Orthogonal Lists
  • two.3. Copse
    • ii.3.one. Traversing Binary Copse
    • 2.iii.2. Binary Tree Representation of Copse
    • two.3.iii. Other Representations of Trees
    • two.3.4. Basic Mathematical Properties of Copse
      • ii.3.4.i. Free trees
      • 2.three.four.2. Oriented trees
      • two.3.4.3. The "infinity lemma"
      • two.iii.four.4. Enumeration of trees
      • 2.3.4.five. Path length
      • two.three.4.6. History and bibliography
    • two.three.5. Lists and Garbage Collection
  • 2.4. Multilinked Structures
  • 2.five. Dynamic Storage Allocation
  • ii.vi. History and Bibliography

Volume 2 – Seminumerical Algorithms [edit]

• Chapter 3 – Random Numbers
  • 3.1. Introduction
  • 3.2. Generating Uniform Random Numbers
    • 3.ii.1. The Linear Congruential Method
      • iii.2.one.i. Pick of modulus
      • 3.two.one.2. Choice of multiplier
      • 3.2.1.3. Potency
    • 3.2.2. Other Methods
  • 3.3. Statistical Tests
    • 3.3.1. General Examination Procedures for Studying Random Data
    • 3.3.two. Empirical Tests
    • 3.3.3. Theoretical Tests
    • 3.3.4. The Spectral Test
  • 3.4. Other Types of Random Quantities
    • three.4.1. Numerical Distributions
    • 3.four.2. Random Sampling and Shuffling
  • 3.5. What Is a Random Sequence?
  • 3.6. Summary
• Chapter iv – Arithmetic
  • 4.one. Positional Number Systems
  • 4.2. Floating Bespeak Arithmetic
    • 4.ii.i. Single-Precision Calculations
    • 4.two.2. Accuracy of Floating Indicate Arithmetic
    • four.two.iii. Double-Precision Calculations
    • four.2.4. Distribution of Floating Bespeak Numbers
  • iv.3. Multiple Precision Arithmetic
    • 4.3.1. The Classical Algorithms
    • 4.3.2. Modular Arithmetic
    • 4.iii.3. How Fast Can We Multiply?
  • 4.4. Radix Conversion
  • iv.five. Rational Arithmetic
    • iv.5.1. Fractions
    • 4.5.2. The Greatest Mutual Divisor
    • four.5.three. Analysis of Euclid's Algorithm
    • 4.five.four. Factoring into Primes
  • 4.6. Polynomial Arithmetic
    • 4.six.i. Sectionalization of Polynomials
    • iv.half-dozen.2. Factorization of Polynomials
    • 4.6.3. Evaluation of Powers (addition-chain exponentiation)
    • iv.6.4. Evaluation of Polynomials
  • iv.7. Manipulation of Power Serial

Volume 3 – Sorting and Searching [edit]

• Chapter 5 – Sorting
  • 5.1. Combinatorial Properties of Permutations
    • v.1.ane. Inversions
    • 5.ane.2. Permutations of a Multiset
    • five.1.3. Runs
    • 5.1.four. Tableaux and Involutions
  • 5.two. Internal sorting
    • 5.2.1. Sorting by Insertion
    • 5.two.2. Sorting by Exchanging
    • 5.2.3. Sorting past Option
    • 5.2.4. Sorting by Merging
    • 5.two.five. Sorting by Distribution
  • five.3. Optimum Sorting
    • 5.three.i. Minimum-Comparison Sorting
    • 5.iii.ii. Minimum-Comparing Merging
    • 5.3.3. Minimum-Comparing Selection
    • 5.3.4. Networks for Sorting
  • five.4. External Sorting
    • 5.4.1. Multiway Merging and Replacement Selection
    • five.4.2. The Polyphase Merge
    • 5.4.3. The Cascade Merge
    • 5.iv.4. Reading Tape Backwards
    • 5.four.5. The Oscillating Sort
    • 5.four.half-dozen. Applied Considerations for Tape Merging
    • 5.4.seven. External Radix Sorting
    • five.iv.8. 2-Record Sorting
    • 5.4.9. Disks and Drums
  • five.5. Summary, History, and Bibliography
• Chapter half dozen – Searching
  • half dozen.1. Sequential Searching
  • vi.ii. Searching by Comparison of Keys
    • half dozen.2.ane. Searching an Ordered Table
    • 6.2.two. Binary Tree Searching
    • 6.2.three. Counterbalanced Trees
    • half dozen.ii.4. Multiway Trees
  • 6.three. Digital Searching
  • 6.4. Hashing
  • 6.5. Retrieval on Secondary Keys

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

• Chapter seven – Combinatorial Searching
  • seven.1. Zeros and Ones
    • 7.1.1. Boolean Basics
    • 7.1.two. Boolean Evaluation
    • 7.1.3. Bitwise Tricks and Techniques
    • vii.1.iv. Binary Conclusion Diagrams
  • 7.2. Generating All Possibilities
    • 7.two.1. Generating Basic Combinatorial Patterns
      • 7.2.1.1. Generating all n-tuples
      • 7.2.1.two. Generating all permutations
      • 7.2.1.3. Generating all combinations
      • 7.2.i.4. Generating all partitions
      • 7.2.1.five. Generating all gear up partitions
      • 7.2.1.half dozen. Generating all copse
      • 7.ii.i.7. History and further references

Planned [edit]

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

• Chapter seven – Combinatorial Searching (continued)
  • 7.ii. Generating all possibilities (continued)
    • 7.2.2. Backtrack programming (published in Fascicle v)
      • 7.2.ii.ane. Dancing links (published in Fascicle five)
      • vii.ii.2.2. Satisfiability (published in Fascicle 6)
      • vii.2.2.iii. Constraint satisfaction
      • 7.two.2.4. Hamiltonian paths and cycles (online draft in pre-fascicle 8A)
      • seven.2.2.5. Cliques
      • 7.2.2.6. Covers (Vertex comprehend, Set cover problem, Exact embrace, Clique comprehend)
      • vii.2.2.vii. Squares
      • 7.two.2.8. A potpourri of puzzles (online draft in pre-fascicle 9B) (includes Perfect digital invariant)
      • 7.2.2.9. Estimating backtrack costs (affiliate 6 of "Selected Papers on Assay of Algorithms", and Fascicle 5, pp 44−47, under the heading "Running time estimates")
    • 7.2.three. Generating inequivalent patterns (includes give-and-take of Pólya enumeration theorem) (see "Techniques for Isomorph Rejection", Ch iv of "Classification Algorithms for Codes and Designs" by Kaski and Östergård)
  • seven.3. Shortest paths
  • vii.four. Graph algorithms
    • 7.4.i. Components and traversal
      • 7.four.ane.1. Union-find algorithms
      • 7.4.1.2. Depth-first search
      • 7.4.one.3. Vertex and edge connectivity
    • 7.4.2. Special classes of graphs
    • vii.4.3. Expander graphs
    • 7.4.4. Random graphs
  • 7.v. Graphs and optimization
    • 7.v.1. Bipartite matching (including maximum-cardinality matching, Stable marriage problem, Mariages Stables)
    • seven.5.ii. The assignment problem
    • 7.v.3. Network flows
    • vii.5.4. Optimum subtrees
    • 7.v.v. Optimum matching
    • 7.v.vi. Optimum orderings
  • seven.6. Independence theory
    • seven.six.1. Independence structures
    • seven.half-dozen.2. Efficient matroid algorithms
  • 7.vii. Discrete dynamic programming (see besides Transfer-matrix method)
  • 7.8. Branch-and-bound techniques
  • vii.nine. Herculean tasks (aka NP-difficult bug)
  • 7.10. Most-optimization
• Chapter 8 – Recursion (chapter 22 of "Selected Papers on Analysis of Algorithms")

Volume 5 – Syntactic Algorithms [edit]

• Chapter ix – Lexical scanning (includes also string search and data compression)
• Chapter 10 – Parsing techniques

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

Volume 7 – Compiler Techniques [edit]

English editions [edit]

Current editions [edit]

These are the current editions in society by volume number:

• The Fine art of Figurer Programming, Volumes one-4A Boxed Set. 3rd Edition (Reading, Massachusetts: Addison-Wesley, 2011), 3168pp. ISBN 978-0-321-75104-1, 0-321-75104-3
  • Volume 1: Fundamental Algorithms. Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xx+650pp. ISBN 978-0-201-89683-one, 0-201-89683-4. Errata: [1] (2011-01-08), [2] (2020-03-26, 27th printing). Addenda: [three] (2011).
  • Book 2: Seminumerical Algorithms. Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xiv+762pp. ISBN 978-0-201-89684-eight, 0-201-89684-2. Errata: [iv] (2011-01-08), [5] (2020-03-26, 26th press). Addenda: [6] (2011).
  • Volume 3: Sorting and Searching. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), xiv+780pp.+foldout. ISBN 978-0-201-89685-5, 0-201-89685-0. Errata: [vii] (2011-01-08), [viii] (2020-03-26, 27th printing). Addenda: [9] (2011).
  • Volume 4A: Combinatorial Algorithms, Part one. Start Edition (Reading, Massachusetts: Addison-Wesley, 2011), xv+883pp. ISBN 978-0-201-03804-0, 0-201-03804-viii. 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-2. Errata: [11] (2020-03-sixteen) (volition exist in the fourth edition of volume 1)
• Volume 4, Fascicle 5: Mathematical Preliminaries Redux; Backtracking; Dancing Links. (Addison-Wesley, 2019-11-22) xiii+382pp, ISBN 978-0-xiii-467179-half-dozen. Errata: [12] (2020-03-27) (volition become office of volume 4B)
• Volume 4, Fascicle 6: Satisfiability. (Addison-Wesley, 2015-12-08) thirteen+310pp, ISBN 978-0-13-439760-3. Errata: [13] (2020-03-26) (will go part of volume 4B)

Previous editions [edit]

Complete volumes [edit]

These volumes were superseded by newer editions and are in order by appointment.

• Book 1: Central Algorithms. Beginning edition, 1968, xxi+634pp, ISBN 0-201-03801-3.^[13]
• Book 2: Seminumerical Algorithms. First edition, 1969, xi+624pp, ISBN 0-201-03802-1.^[13]
• Volume iii: Sorting and Searching. First edition, 1973, xi+723pp+foldout, ISBN 0-201-03803-Ten. Errata: [xiv].
• Volume i: Fundamental Algorithms. 2nd edition, 1973, xxi+634pp, ISBN 0-201-03809-9. Errata: [15].
• Volume ii: Seminumerical Algorithms. 2nd edition, 1981, xiii+ 688pp, ISBN 0-201-03822-half-dozen. Errata: [sixteen].
• The Fine art of Computer Programming, Volumes 1-3 Boxed Set. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), pp. ISBN 978-0-201-48541-7, 0-201-48541-9

Fascicles [edit]

Volume 4'south fascicles 0–iv were revised and published as 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-four. Errata: [17] (2011-01-01).
• Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams. (Addison-Wesley Professional person, 2009-03-27) viii+260pp, ISBN 0-321-58050-8. Errata: [xviii] (2011-01-01).
• Volume 4, Fascicle ii: Generating All Tuples and Permutations. (Addison-Wesley, 2005-02-14) v+127pp, ISBN 0-201-85393-0. Errata: [19] (2011-01-01).
• Volume 4, Fascicle iii: Generating All Combinations and Partitions. (Addison-Wesley, 2005-07-26) half dozen+150pp, ISBN 0-201-85394-9. Errata: [20] (2011-01-01).
• Book 4, Fascicle 4: Generating All Trees; History of Combinatorial Generation. (Addison-Wesley, 2006-02-06) vi+120pp, ISBN 0-321-33570-8. Errata: [21] (2011-01-01).

Volume 4's fascicles 5–6 will get part of Book 4B:

• Volume 4, Fascicle 5: Mathematical Preliminaries Redux; Backtracking; Dancing Links. (Addison-Wesley, 2019-eleven-22) xiii+382pp, ISBN 978-0-13-467179-6. Errata: [22] (2020-03-27)
• Book four, Fascicle 6: Satisfiability. (Addison-Wesley, 2015-12-08) xiii+310pp, ISBN 978-0-13-439760-three. Errata: [23] (2020-03-26)

Pre-fascicles [edit]

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

Volume 4'southward pre-fascicle 6A was revised and published as fascicle 6.

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

Come across also [edit]

• Introduction to Algorithms

References [edit]

Notes

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

Citations

1. ^ "annotation for box three, folder 1".
2. ^ "Addison-Wesley Pearson webpage".
3. ^ "Pearson Educational".
4. ^ Frana, Philip L. (2001-xi-08). "An Interview with Donald E. Knuth". hdl:11299/107413.
5. ^ Donald Knuth, This Week's Commendation Classic, Current Contents, Number 34 (August 23, 1993), page 8.
6. ^ Albers, Donald J. (2008). "Donald Knuth". In Albers, Donald J.; Alexanderson, Gerald L. (eds.). Mathematical People: Profiles and Interviews (two ed.). A M Peters. ISBN978-ane-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 unmarried problem in the offset volume. In some cases I settled for but understanding what the question was trying to ask for. In some cases I failed fifty-fifty to accomplish that (don't gauge me until y'all endeavour information technology yourself). Each problem is assigned a difficulty rating from 0-50 where 0 is little and 50 is "unsolved research problem" (in the first edition, Fermat's terminal theorem was listed every bit a 50, just since Andrew Wiles proved information technology, information technology'due south bumped down to a 45 in the current edition). I think I was able to solve nearly of the problems rated < 20 — it was striking and miss beyond that. Virtually of the problems vicious into the 20-thirty difficulty range, but Knuth's idea of "difficult" is subjective, and problems that he considers to be of average difficulty ended up stretching my comparatively tiny brain painfully. I've never climbed Mount Everest, simply I imagine the whole ordeal feels similar: painful while you're going through it, but triumphant when you reach the pinnacle.
8. ^ "Donald Eastward. Knuth – A. One thousand. Turing Award Winner". AM Turing . Retrieved 2017-01-25 .
9. ^ Morrison, Philip; Morrison, Phylis (Nov–December 1999). "100 or and then Books that shaped a Century of Scientific discipline". American Scientist. Sigma Xi, The Scientific Inquiry Society. 87 (6). Archived from the original on 2008-08-20. Retrieved 2008-01-xi .
10. ^ Weinberger, Matt. "Bill Gates once said 'definitely send me a résumé' if yous finish this fiendishly hard book". Business Insider . Retrieved 2016-06-13 .
11. ^ Lohr, Steve (2001-12-17). "Frances East. Holberton, 84, Early Figurer Programmer". The New York Times . Retrieved 2010-05-17 .
12. ^ "TAOCP – Future plans".
13. ^ ^{a b} Wells, Mark B. (1973). "Review: The Art of Computer Programming, Volume ane. Central Algorithms and Volume 2. Seminumerical Algorithms by Donald E. Knuth" (PDF). Bulletin of the American Mathematical Order. 79 (3): 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 fifteen Great Figurer Scientists . Copernicus. ISBN0-387-97992-1.

External links [edit]

• Overview of topics (Knuth'south personal homepage)
• Oral history interview with Donald East. Knuth at Charles Babbage Plant, University of Minnesota, Minneapolis. Knuth discusses software patenting, structured programming, collaboration and his evolution of TeX. The oral history discusses the writing of The Art of Figurer Programming.
• "Robert W Floyd, In Memoriam", past Donald Due east. Knuth - (on the influence of Bob Floyd)
• TAoCP and its Influence of Computer science (Softpanorama)

alfordaunteliend.blogspot.com

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

Share this post