计算机程序设计艺术精装共三卷（第3版·影印版） (2008 年度畅销榜NO.583 )

第1卷首先介绍编程的基本概念和技术，然后详细讲解信息结构方面的内容，包括信息在计算机内部的表示方法、数据元素之间的结构关系，以及有效的信息处理方法。此外，书中还描述了编程在模拟、数值方法、符号计算、软件与系统设计等方面的初级应用。新版本增加了数十项简单但重要的算法和技术，并根据当前研究发展趋势在数学预备知识方面做了大量修改。\r\n

Chapter 1 Basic Concepts \r\n1.1. Algorithms\r\n1.2. Mathematical Preliminaries \r\n1.2.1. Mathematical Induction \r\n1.2.2. Numbers, Powers, and Logarithms \r\n1.2.3. Sums and Products \r\n1.2.4. Integer Functions and Elementary Number Theory \r\n1.2.5. Permutations and Factorials \r\n1.2.6. Binomial Coefficients \r\n1.2.7. Harmonic Numbers \r\n1.2.8. Fibonacci Numbers \r\n1.2.9. Generating Functions \r\n1.2.10. Analysis of an Algorithm \r\n*1.2.11. Asymptotic Representations \r\n*1.2.11.1. The O-notation \r\n*1.2.11.2. Euler's summation formula \r\n*1.2.11.3. Some asymptotic calculations \r\n1.3. MIX 124\r\n1.3.1. Description of MIX \r\n1.3.2. The MIX Assembly Language \r\n1.3.3. Applications to Permutations \r\n1.4. Some Fundamental Programming Techniques \r\n1.4.1. Subroutines \r\n1.4.2. Goroutines \r\n1.4.3. Interpretive Routines \r\n1.4.3.1. A MIX simulator \r\n*1.4.3.2. Trace routines \r\n1.4.4. Input and Output \r\n1.4.5. History and Bibliography \r\n\r\nChapter 2 Information Structures \r\n2.1. Introduction \r\n2.2. Linear Lists \r\n2.2.1. Stacks, Queues, and Deques \r\n2.2.2. Sequential Allocation \r\n2.2.3. Linked Allocation \r\n2.2.4. Circular Lists \r\n2.2.5. Doubly Linked Lists \r\n2 2.6. Arrays and Orthogonal Lists \r\n2.3. Trees \r\n2.3.1. Traversing Binary Trees \r\n2.3.2. Binary Tree Representation of Trees \r\n2.3.3. Other Representations of Trees \r\n2.3.4. Basic Mathematical Properties of Trees \r\n2.3.4.1. Free trees \r\n2.3.4.2. Oriented trees \r\n*2.3.4.3. The "infinity lemma" \r\n*2.3.4.4. Enumeration of trees \r\n2.3.4.5. Path length \r\n*2.3.4.6. History and bibliography \r\n2.3.5. Lists and Garbage Collection \r\n2.4. Multilinked Structures \r\n2.5. Dynamic Storage Allocation \r\nHistory and Bibliography \r\nAnswers to Exercises\r\n\r\nAppendix A Tables of Numerical Quantities \r\n1. Fundamental Constants (decimal) \r\n2. Fundamental Constants (octal) \r\n3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers \r\n\r\nAppendix B Index to Notations \r\nIndex and Glossary \r\nExcerpt \r\n\r\nChapter 3 Random Numbers. \r\nIntroduction. \r\nGenerating Uniform Random Numbers. \r\nThe Linear Congruential Method. \r\nOther Methods. \r\nStatistical Tests. \r\nGeneral Test Procedures for Studying Random Data. \r\nEmpirical Tests. \r\nTheoretical Tests. \r\nThe Spectral Test. \r\nOther Types of Random Quantities. \r\nNumerical Distributions. \r\nRandom Sampling and Shuffling. \r\nWhat Is a Random Sequence? \r\nSummary. \r\n\r\nChapter 4 Arithmetic. \r\nPositional Number Systems. \r\nFloating Point Arithmetic. \r\nSingle-Precision Calculations. \r\nAccuracy of Floating Point Arithmetic. \r\nDouble-Precision Calculations. \r\nDistribution of Floating Point Numbers. \r\nMultiple Precision Arithmetic. \r\nThe Classical Algorithms. \r\nModular Arithmetic. \r\nHow Fast Can We Multiply?. \r\nRadix Conversion. \r\nRational Arithmetic. \r\nFractions. \r\nThe Greatest Common Divisor. \r\nAnalysis of Euclid's Algorithm. \r\nFactoring into Primes. \r\nPolynomial Arithmetic. \r\nDivision of Polynomials. \r\nFactorization of Polynomials. \r\nEvaluation of Powers. \r\nEvaluation of Polynomials. \r\nManipulation of Power Series. \r\nAnswers to Exercises. \r\n\r\nAppendix A: Tables of Numerical Quantities. \r\nFundamental Constants (decimal). \r\nFundamental Constants (octal). \r\nHarmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. \r\n\r\nAppendix B: Index to Notations. \r\nIndex and Glossary. \r\n\r\nChapter 5 Sorting. \r\nCombinatorial Properties of Permutations. \r\nInversions. \r\nPermutations of a Multiset. \r\nRuns. \r\nTableaux and Involutions. \r\nInternal sorting. \r\nSorting by Insertion. \r\nSorting by Exchanging. \r\nSorting by Selection. \r\nSorting by Merging. \r\nSorting by Distribution. \r\nOptimum Sorting. \r\nMinimum-Comparison Sorting. \r\nMinimum-Comparison Merging. \r\nMinimum-Comparison Selection. \r\nNetworks for Sorting. \r\nExternal Sorting. \r\nMultiway Merging and Replacement Selection. \r\nThe Polyphase Merge. \r\nThe Cascade Merge. \r\nReading Tape Backwards. \r\nThe Oscillating Sort. \r\nPractical Considerations for Tape Merging. \r\nExternal Radix Sorting. \r\nTwo-Tape Sorting. \r\nDisks and Drums. \r\nSummary, History, and Bibliography. \r\n\r\nChapter 6 Searching. \r\nSequential Searching. \r\nSearching by Comparison of Keys. \r\nSearching an Ordered Table. \r\nBinary Tree Searching. \r\nBalanced Trees. \r\nMultiway Trees. \r\nDigital Searching. \r\nHashing. \r\nRetrieval on Secondary Keys. \r\nAnswers to Exercises. \r\n\r\nAppendix A: Tables of Numerical Quantities. \r\nFundamental Constants (decimal). \r\nFundamental Constants (octal). \r\nHarmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. \r\n\r\nAppendix B:Index to Notations. \r\nIndex and Glossary.