注冊(cè) | 登錄讀書好,好讀書,讀好書!
讀書網(wǎng)-DuShu.com
當(dāng)前位置: 首頁出版圖書科學(xué)技術(shù)計(jì)算機(jī)/網(wǎng)絡(luò)軟件與程序設(shè)計(jì)其他編程語言/工具計(jì)算機(jī)程序設(shè)計(jì)藝術(shù):英文版(第1卷 基本算法)

計(jì)算機(jī)程序設(shè)計(jì)藝術(shù):英文版(第1卷 基本算法)

計(jì)算機(jī)程序設(shè)計(jì)藝術(shù):英文版(第1卷 基本算法)

定 價(jià):¥248.00

作 者: (美)Donald E. Knuth著
出版社: 清華大學(xué)出版社
叢編項(xiàng): 英文影印版
標(biāo) 簽: 暫缺

ISBN: 9787302058144 出版時(shí)間: 2002-09-01 包裝: 精裝
開本: 23cm 頁數(shù): 2248 字?jǐn)?shù):  

內(nèi)容簡介

  《計(jì)算機(jī)程序設(shè)計(jì)藝術(shù)(中文版)(1-3卷精裝全套)》《計(jì)算機(jī)程序設(shè)計(jì)藝術(shù)》專題該套圖書共3卷,內(nèi)容如下:卷1為基礎(chǔ)運(yùn)算法則,該書以基本的編程概念和技術(shù)為開始,然后講述信息結(jié)構(gòu):計(jì)算機(jī)內(nèi)信息的表示法,數(shù)據(jù)元素間的結(jié)構(gòu)關(guān)系以及處理它們的有效方法。主要應(yīng)用于模擬、數(shù)字方法、符號(hào)計(jì)算、軟件和系統(tǒng)設(shè)計(jì)。許多簡單和重要的運(yùn)算法則和技術(shù)已添加到前一版本中,精確的初步計(jì)算部分已經(jīng)修改,以適應(yīng)當(dāng)前趨勢(shì)。第2卷對(duì)半數(shù)值算法領(lǐng)域做了全面介紹,分“隨機(jī)數(shù)”和“算術(shù)”兩章。本卷總結(jié)了主要算法范例及這些算法的基本理論,廣泛剖析了計(jì)算機(jī)程序設(shè)計(jì)與數(shù)值分析間的相互聯(lián)系。第3版中特別值得注意的是Knuth對(duì)隨機(jī)數(shù)生成程序的重新處理和對(duì)形式冪級(jí)數(shù)計(jì)算的討論。卷3為分揀和搜索,這是本書的第1個(gè)修訂版,它是對(duì)計(jì)算機(jī)分揀和搜索的一流技術(shù)的最全面的研究,它擴(kuò)展了卷1中數(shù)據(jù)結(jié)構(gòu)的處理方法,將大小數(shù)據(jù)庫以及內(nèi)存和外部存儲(chǔ)都包含在內(nèi)。本書包括對(duì)計(jì)算機(jī)方法仔細(xì)檢查的選擇方案,和其效率的大量分析。本書該版的獨(dú)特之處在于優(yōu)化了的分揀,以及對(duì)通用散列法和排列法的新的理論論述。

作者簡介

  Donald.E.Knuth(唐納德.E.克努特,中文名高德納)是算法和程序設(shè)計(jì)技術(shù)的先驅(qū)者,是計(jì)算機(jī)排版系統(tǒng)TEX和METAFONT的發(fā)明者,他因這些成就和大量創(chuàng)造性的影響深遠(yuǎn)的著作(19部書和160篇論文)而譽(yù)滿全球。作為斯坦福大學(xué)計(jì)算機(jī)程序設(shè)計(jì)藝術(shù)的榮譽(yù)退休教授,他當(dāng)前正全神貫注于完成其關(guān)于計(jì)算機(jī)科學(xué)的史詩性的七卷集。這一偉大工程在1962年他還是加利福尼亞理工學(xué)院的研究生時(shí)就開始了。Knuth教授獲得了許多獎(jiǎng)項(xiàng)和榮譽(yù),包括美國計(jì)算機(jī)協(xié)會(huì)圖靈獎(jiǎng)(ACMTuringAward),美國前總統(tǒng)卡特授予的科學(xué)金獎(jiǎng)(MedalofScience),美國數(shù)學(xué)學(xué)會(huì)斯蒂爾獎(jiǎng)(AMSSteelePrize),以及1996年11月由于發(fā)明先進(jìn)技術(shù)而榮獲的備受推崇的京都獎(jiǎng)(KyotoPrize)。Knuth教授現(xiàn)與其妻Jill生活于斯坦福校園內(nèi)。訪問Knuth教授的個(gè)人主頁,可以獲得有關(guān)本書及本系列其他未出版圖書的更多信息:www-cs-faculty.stanford.edu/~knuth

圖書目錄

Chapter 1 Basic Concepts
1.1. Algorithms
1.2. Mathematical Preliminaries
1.2.1. Mathematical Induction
1.2.2. Numbers, Powers, and Logarithms
1.2.3. Sums and Products
1.2.4. Integer Functions and Elementary Number Theory
1.2.5. Permutations and Factorials
1.2.6. Binomial Coefficients
1.2.7. Harmonic Numbers
1.2.8. Fibonacci Numbers
1.2.9. Generating Functions
1.2.10. Analysis of an Algorithm
*1.2.11. Asymptotic Representations
*1.2.11.1. The O-notation
*1.2.11.2. Euler's summation formula
*1.2.11.3. Some asymptotic calculations
1.3. MIX 124
1.3.1. Description of MIX
1.3.2. The MIX Assembly Language
1.3.3. Applications to Permutations
1.4. Some Fundamental Programming Techniques
1.4.1. Subroutines
1.4.2. Goroutines
1.4.3. Interpretive Routines
1.4.3.1. A MIX simulator
*1.4.3.2. Trace routines
1.4.4. Input and Output
1.4.5. History and Bibliography

Chapter 2 Information Structures
2.1. Introduction
2.2. Linear Lists
2.2.1. Stacks, Queues, and Deques
2.2.2. Sequential Allocation
2.2.3. Linked Allocation
2.2.4. Circular Lists
2.2.5. Doubly Linked Lists
2 2.6. Arrays and Orthogonal Lists
2.3. Trees
2.3.1. Traversing Binary Trees
2.3.2. Binary Tree Representation of Trees
2.3.3. Other Representations of Trees
2.3.4. Basic Mathematical Properties of Trees
2.3.4.1. Free trees
2.3.4.2. Oriented trees
*2.3.4.3. The "infinity lemma"
*2.3.4.4. Enumeration of trees
2.3.4.5. Path length
*2.3.4.6. History and bibliography
2.3.5. Lists and Garbage Collection
2.4. Multilinked Structures
2.5. Dynamic Storage Allocation
History and Bibliography
Answers to Exercises

Appendix A Tables of Numerical Quantities
1. Fundamental Constants (decimal)
2. Fundamental Constants (octal)
3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers

Appendix B Index to Notations
Index and Glossary
Excerpt

Chapter 3 Random Numbers.
Introduction.
Generating Uniform Random Numbers.
The Linear Congruential Method.
Other Methods.
Statistical Tests.
General Test Procedures for Studying Random Data.
Empirical Tests.
Theoretical Tests.
The Spectral Test.
Other Types of Random Quantities.
Numerical Distributions.
Random Sampling and Shuffling.
What Is a Random Sequence?
Summary.

Chapter 4 Arithmetic.
Positional Number Systems.
Floating Point Arithmetic.
Single-Precision Calculations.
Accuracy of Floating Point Arithmetic.
Double-Precision Calculations.
Distribution of Floating Point Numbers.
Multiple Precision Arithmetic.
The Classical Algorithms.
Modular Arithmetic.
How Fast Can We Multiply?.
Radix Conversion.
Rational Arithmetic.
Fractions.
The Greatest Common Divisor.
Analysis of Euclid's Algorithm.
Factoring into Primes.
Polynomial Arithmetic.
Division of Polynomials.
Factorization of Polynomials.
Evaluation of Powers.
Evaluation of Polynomials.
Manipulation of Power Series.
Answers to Exercises.

Appendix A: Tables of Numerical Quantities.
Fundamental Constants (decimal).
Fundamental Constants (octal).
Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.

Appendix B: Index to Notations.
Index and Glossary.

Chapter 5 Sorting.
Combinatorial Properties of Permutations.
Inversions.
Permutations of a Multiset.
Runs.
Tableaux and Involutions.
Internal sorting.
Sorting by Insertion.
Sorting by Exchanging.
Sorting by Selection.
Sorting by Merging.
Sorting by Distribution.
Optimum Sorting.
Minimum-Comparison Sorting.
Minimum-Comparison Merging.
Minimum-Comparison Selection.
Networks for Sorting.
External Sorting.
Multiway Merging and Replacement Selection.
The Polyphase Merge.
The Cascade Merge.
Reading Tape Backwards.
The Oscillating Sort.
Practical Considerations for Tape Merging.
External Radix Sorting.
Two-Tape Sorting.
Disks and Drums.
Summary, History, and Bibliography.

Chapter 6 Searching.
Sequential Searching.
Searching by Comparison of Keys.
Searching an Ordered Table.
Binary Tree Searching.
Balanced Trees.
Multiway Trees.
Digital Searching.
Hashing.
Retrieval on Secondary Keys.
Answers to Exercises.

Appendix A: Tables of Numerical Quantities.
Fundamental Constants (decimal).
Fundamental Constants (octal).
Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.

Appendix B:Index to Notations.
Index and Glossary.


本目錄推薦

掃描二維碼
Copyright ? 讀書網(wǎng) m.ranfinancial.com 2005-2020, All Rights Reserved.
鄂ICP備15019699號(hào) 鄂公網(wǎng)安備 42010302001612號(hào)