注冊 | 登錄讀書好,好讀書,讀好書!
讀書網(wǎng)-DuShu.com
當前位置: 首頁出版圖書科學技術計算機/網(wǎng)絡軟件與程序設計其他編程語言/工具計算機程序設計藝術:英文版(第3卷 排序和查找)

計算機程序設計藝術:英文版(第3卷 排序和查找)

計算機程序設計藝術:英文版(第3卷 排序和查找)

定 價:¥248.00

作 者: (美)Donald E. Knuth著
出版社: 清華大學出版社
叢編項: 排序和查找(第2版·英文影印版
標 簽: 暫缺

ISBN: 9787302058168 出版時間: 2002-09-01 包裝: 精裝
開本: 24cm 頁數(shù): 780 字數(shù):  

內(nèi)容簡介

  為反映計算機領域的最新發(fā)展,Knuth二十多年來第一次將三卷書全部做了修訂。他的修訂主要集中在自上一版以來得到眾人認可的新知識,已經(jīng)解決的問題,以及有所變化的問題。為保持本書的權威性,在必要的地方對計算機領域先驅工作的歷史信息做了更新;為維護作者苦心孤詣追求至善至美的盛譽,新版本對讀者發(fā)現(xiàn)的少量技術性錯誤做了更正;為增加本書的挑戰(zhàn)性,作者還添加了數(shù)百道習題。本套書由3卷組成。第1卷基本算法::::第1卷首先介紹編程的基本概念和技術,然后詳細講解信息結構方面的內(nèi)容,包括信息在計算機內(nèi)部的表示方法、數(shù)據(jù)元素之間的結構關系,以及有效的信息處理方法。此外,書中還描述了編程在模擬、數(shù)值方法、符號計算、軟件與系統(tǒng)設計等方面的初級應用。新版本增加了數(shù)十項簡單但重要的算法和技術,并根據(jù)當前研究發(fā)展趨勢在數(shù)學預備知識方面做了大量修改。第2卷半數(shù)值算法::::第2卷對半數(shù)值算法領域做了全面介紹,分“隨機數(shù)”和“算術”兩章。本卷總結了主要算法范例及這些算法的基本理論,廣泛剖析了計算機程序設計與數(shù)值分析間的相互聯(lián)系。第3版中最引人注目的是,Knuth對隨機數(shù)生成器進行了重新處理,對形式冪級數(shù)計算作了深入討論。第3卷排序和查找::::這是對第3卷的頭一次修訂,不僅是對經(jīng)典計算機排序和查找技術的最全面介紹,而且還對第1卷中的數(shù)據(jù)結構處理技術作了進一步的擴充,通盤考慮了將大小型數(shù)據(jù)庫和內(nèi)外存儲器。它遴選了一些經(jīng)過反復檢驗的計算機方法,并對其效率做了定量分析。第3卷的突出特點是對“最優(yōu)排序”一節(jié)作了修訂,對排列論原理與通用散列法作了全新討論。本套書適用于所有需要深入學習編程的計算機人員,也可以作為計算機專業(yè)的教材。

作者簡介

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