书籍详情
计算机程序设计艺术：第1卷 基本算法（英文版 第3版）
作者：（美国）Donald E.Knuth
出版社：机械工业出版社
出版时间：2008-01-01
ISBN：9787111227090
定价：¥95.00
购买这本书可以去
内容简介
关于算法分析的这多卷论著已经长期被公认为经典计算机科学的定义性描述。迄今已出版的完整的三卷已经组成了程序设计理论和实践的惟一的珍贵资源，无数读者都赞扬Knuth的著作对个人的深远影响，科学家们为他的分析的美丽和优雅所惊叹，而从事实践的程序员已经成功地将他的“菜谱式”的解应用到日常问题上，所有人都由于Knuth在书中表现出的博学、清晰、精确和高度幽默而对他无比敬仰。第1卷为基本算法，分“基本概念”和“信息结构”两章。本卷以基本的编程概念和技术开始，然后讲述信息结构——计算机内信息的表示法、数据元素间的结构关系以及处理它们的有效方法。
作者简介
Donald E.Knuth（唐纳德E.克努特，中文名高德纳）算法和程序设计技术的先驱者、计算机排版系统TEX和METAFONT的发明者，他因这些成就以及大量富于创造力和具有深远影响的著作（19部书，1160篇论文）而誉满全球.作为斯坦福大学关于计算机程序设计艺术的荣誉退休教授，1目前他正投入全部精力完成关于计算机科学的史诗性的七卷集的工作.这一伟大工程在1962年他还是加州理工学院的研究生时就开始了。Knuth教授获得了许多奖项和荣誉，包括美国计算机协会图灵奖（ACM Turing Award）、美国前总统卡特授予的科学金奖（Medal of Science）、美国数学学会斯蒂尔奖（AMS Steele Prize）、以及1996年11月由于发明先进技术而荣获的极受尊重的京都奖（Kyoto Prize）
目录
Chapter1 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 Fun tions and Elementary Number Theory
1.2.5 Permutations andcFa torials
1.2.6 Binomial Coefficients
1.2.7 Harmonic Numbers
1.2.8 Fibonacci Numbers
1.2.9 Generating Fun tions
1.2.10 Analysis of anc Algorithm
1.2.11 Asymptotic Representation
1.2.11.1 The O-notation
1.2.11.2 Euler's summation formul
1.2.11.3 Some asymptotic calculations
1.3 MIX
1.3.1 Description of MIX
1.3.2 ThecMIX Assembly Language
1.3.3 Applications to Permutations
1.4 Some Fundamental Programming Techniques
1.4.1 Subroutines
1.4.2 Coroutines
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
Chapter2--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 Freectrees
2.3.4.2 Orientedctrees
2.3.4.3 The "infinityclemma"
2.3.4.4 Enumeration of trees
2.3.4.5 Pathclength
2.3.4.6 History and bibliography
2.3.5 Lists and Garbage Collection
2.4 Multilinked Structures
2.5 Dynamic Storage Allocation
2.6 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, FibonaccicNumbers
Appendix B Indexcto Notations
Index and Glossary
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 Fun tions and Elementary Number Theory
1.2.5 Permutations andcFa torials
1.2.6 Binomial Coefficients
1.2.7 Harmonic Numbers
1.2.8 Fibonacci Numbers
1.2.9 Generating Fun tions
1.2.10 Analysis of anc Algorithm
1.2.11 Asymptotic Representation
1.2.11.1 The O-notation
1.2.11.2 Euler's summation formul
1.2.11.3 Some asymptotic calculations
1.3 MIX
1.3.1 Description of MIX
1.3.2 ThecMIX Assembly Language
1.3.3 Applications to Permutations
1.4 Some Fundamental Programming Techniques
1.4.1 Subroutines
1.4.2 Coroutines
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
Chapter2--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 Freectrees
2.3.4.2 Orientedctrees
2.3.4.3 The "infinityclemma"
2.3.4.4 Enumeration of trees
2.3.4.5 Pathclength
2.3.4.6 History and bibliography
2.3.5 Lists and Garbage Collection
2.4 Multilinked Structures
2.5 Dynamic Storage Allocation
2.6 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, FibonaccicNumbers
Appendix B Indexcto Notations
Index and Glossary
猜您喜欢
