点击选择搜索分类
首页 - 大陆动漫- 正文
☆☆☆☆☆
||
[美] 塞奇威克(Sedgewick R.) 著
出版社: 机械工业出版社 ISBN:9787111186069 版次:1 商品编码:10132322 品牌:机工出版 包装:平装 丛书名: 经典原版书库 开本:16开 出版时间:2006-04-01 用纸:胶版纸 页数:492
本书全面介绍了算法的数学分析中使用的基本方法,所涉及的内容来自经典的数学素材(包括离散数学、初等实分析、组合数学),以及经典的计算机科学素材(包括算法和数据结构)。虽然书中论述了“最坏情形”和“复杂性问题”分析所需的基本数学工具,但是重点还是讨论“平均情形”或“概率”分析。论题涉及递归、生成函数、渐近性、树、串、映射等内容,以及对排序、树查找、串查找和散列诸算法的分析。
尽管人们极为关注算法的数学分析,但是广泛使用的方法和模型方面的基本信息尚不能为该领域的工作和研究所直接使用。作者在本书中处理这种需求,把该领域出现的挑战以及为跟上新的研究以迎接这些挑战所必需的背景资料完美地结合在一起。
——Donald E. Knuth
1.1 Why Analyze an Algorithm?
1.2 Computational Complexity
1.3 Analysis of Algorithms
1.4 Average-Case Analysis
1.5 Example: Analysis of Quieksort
1.6 Asymptotic Approximations
1.7 Distributions
1.8 Probabilistic Algorithms
CHAPTER TWO: RECURRENCE RELATIONS
2.1 Basic Properties
2.2 First-Order Recurrences
2.3 Nonlinear First-Order Recurrences
2.4 Higher-Order Recurrences
2.5 Methods for Solving Recurrences
2.6 Binary Divide-and-Conquer Recurrences and Binary
Numbers
2.7 General Divide-and-Conquer Recurrences
CHAPTER THREE: GENERATING FUNCTIONS
3.1 Ordinary Generating Functions
3.2 Exponential Generating Functions
3.3 Generating Function Solution of Recurrences
3.4 Expanding Generating Functions
3.5 Transformations with Generating Functions
3.6 Functional Equations on Generating Functions
3.7 Solving the Quicksort Median-of-Three Recurrencewith OGFS
3.8 Counting with Generating Functions
3.9 The Symbolic Method
3.10 Lagrange Inversion
3.11 Probability Generating Functions
3.12 Bivariate Generating Functions
3.13 Special Functions
CHAPTER FOUR: ASYMPTOTIC APPROXIMATIONS
4.1 Notation for Asymptotic Approximations
4.2 Asymptotic Expansions
4.3 Manipulating Asymptotic Expansions
4.4 Asymptotic Approximations of Finite Sums
4.5 Euler-Maclaurin Summation
4.6 Bivariate Asymptotics
4.7 Laplace Method
4.8 “Normal”Examples from the Analysis of Algorithms
4.9 “Poisson” Examples from the Analysis of Algorithms
4.10 Generating Function Asymptotics
CHAPTER FIVE: TREES
5.1 Binary Trees
5.2 Trees and Forests
5.3 Properties of Trees
5.4 Tree Algorithms
5.5 Binary Search Trees
5.6 Average Path Length in Catalan Trees
5.7 Path Length in Binary Search Trees
5.8 Additive Parameters of Random Trees
5.9 Height
5.10 Summary of Average-Case Results on Properties of Trees
5.11 Representations of Trees and Binary Trees
5.12 Unordered Trees
5.13 Labelled Trees
5.14 Other Types of Trees
CHAPTER SIX: PERMUTATIONS
6.1 Basic Properties of Permutations
6.2 Algorithms on Permutations
6.3 Representations of Permutations
6.4 Enumeration Problems
6.5 Analyzing Properties of Permutations with CGFs
6.6 Inversions and Insertion Sorts
6.7 Left-to-Right Minima and Selection Sort
6.8 Cycles and In Situ Permutation
6.9 Extremal Parameters
CHAPTER SEVEN:STRINGS AND TRIES
7.1 String Searching
7.2 Combinatorial Properties of Bitstrings
7.3 Regular Expressions
7.4 Finite-State Automata and the Knuth-Morris-Pratt
Algorithm
7.5 Context-Free Grammars
7.6 Tries
7.7 Trie Algorithms
7.8 Combinatorial Properties of Tries
7.9 Larger Alphabets
CHAPTER EIGHT: WORDS AND MAPS
8.1 Hashing with Separate Chaining
8.2 Basic Properties of Words
8.3 Birthday Paradox and Coupon Collector Problem
8.4 Occupancy Restrictions and Extremal Parameters
8.5 Occupancy Distributions
8.6 Open Addressing Hashing
8.7 Maps
8.8 Integer Facterization and Maps
List of Theorems
Index
算法分析导论(英文版) 电子书 下载 mobi epub pdf txt
算法分析导论(英文版)-so88
算法分析导论(英文版) pdf epub mobi txt 电子书 下载 2022
图书介绍
☆☆☆☆☆
||
[美] 塞奇威克(Sedgewick R.) 著
出版社: 机械工业出版社 ISBN:9787111186069 版次:1 商品编码:10132322 品牌:机工出版 包装:平装 丛书名: 经典原版书库 开本:16开 出版时间:2006-04-01 用纸:胶版纸 页数:492
内容简介
本书为全英文。它全面介绍了算法的数学分析中使用的基本方法,所涉及的内容来自经典的数学素材(包括离散数学、初等实分析、组合数学),以及经典的计算机科学素材(包括算法和数据结构)。虽然书中论述了“最坏情形”和“复杂性问题”分析所需的基本数学工具,但是重点还是讨论“平均情形”或“概率”分析。论题涉及递归、生成函数、渐近性、树、串、映射等内容,以及对排序、树查找、串查找和散列诸算法的分析。本书全面介绍了算法的数学分析中使用的基本方法,所涉及的内容来自经典的数学素材(包括离散数学、初等实分析、组合数学),以及经典的计算机科学素材(包括算法和数据结构)。虽然书中论述了“最坏情形”和“复杂性问题”分析所需的基本数学工具,但是重点还是讨论“平均情形”或“概率”分析。论题涉及递归、生成函数、渐近性、树、串、映射等内容,以及对排序、树查找、串查找和散列诸算法的分析。
尽管人们极为关注算法的数学分析,但是广泛使用的方法和模型方面的基本信息尚不能为该领域的工作和研究所直接使用。作者在本书中处理这种需求,把该领域出现的挑战以及为跟上新的研究以迎接这些挑战所必需的背景资料完美地结合在一起。
精彩书评
分析算法的人享有双重的幸福。首先,他们能够体验到优雅数学模式纯粹的美,这处模式存在于优美的计算过程之中。其次,当他们的理论使得其他工作能够做得更快、更经济时,他们得到的是实际的褒奖。因此,我们盼望已久的这部著作极受欢迎。该书作者不仅是该领域世界范围内的领袖,而且还是阐述的大师。——Donald E. Knuth
目录
CHAPTER ONE:ANALYSIS OF ALGORITHMS1.1 Why Analyze an Algorithm?
1.2 Computational Complexity
1.3 Analysis of Algorithms
1.4 Average-Case Analysis
1.5 Example: Analysis of Quieksort
1.6 Asymptotic Approximations
1.7 Distributions
1.8 Probabilistic Algorithms
CHAPTER TWO: RECURRENCE RELATIONS
2.1 Basic Properties
2.2 First-Order Recurrences
2.3 Nonlinear First-Order Recurrences
2.4 Higher-Order Recurrences
2.5 Methods for Solving Recurrences
2.6 Binary Divide-and-Conquer Recurrences and Binary
Numbers
2.7 General Divide-and-Conquer Recurrences
CHAPTER THREE: GENERATING FUNCTIONS
3.1 Ordinary Generating Functions
3.2 Exponential Generating Functions
3.3 Generating Function Solution of Recurrences
3.4 Expanding Generating Functions
3.5 Transformations with Generating Functions
3.6 Functional Equations on Generating Functions
3.7 Solving the Quicksort Median-of-Three Recurrencewith OGFS
3.8 Counting with Generating Functions
3.9 The Symbolic Method
3.10 Lagrange Inversion
3.11 Probability Generating Functions
3.12 Bivariate Generating Functions
3.13 Special Functions
CHAPTER FOUR: ASYMPTOTIC APPROXIMATIONS
4.1 Notation for Asymptotic Approximations
4.2 Asymptotic Expansions
4.3 Manipulating Asymptotic Expansions
4.4 Asymptotic Approximations of Finite Sums
4.5 Euler-Maclaurin Summation
4.6 Bivariate Asymptotics
4.7 Laplace Method
4.8 “Normal”Examples from the Analysis of Algorithms
4.9 “Poisson” Examples from the Analysis of Algorithms
4.10 Generating Function Asymptotics
CHAPTER FIVE: TREES
5.1 Binary Trees
5.2 Trees and Forests
5.3 Properties of Trees
5.4 Tree Algorithms
5.5 Binary Search Trees
5.6 Average Path Length in Catalan Trees
5.7 Path Length in Binary Search Trees
5.8 Additive Parameters of Random Trees
5.9 Height
5.10 Summary of Average-Case Results on Properties of Trees
5.11 Representations of Trees and Binary Trees
5.12 Unordered Trees
5.13 Labelled Trees
5.14 Other Types of Trees
CHAPTER SIX: PERMUTATIONS
6.1 Basic Properties of Permutations
6.2 Algorithms on Permutations
6.3 Representations of Permutations
6.4 Enumeration Problems
6.5 Analyzing Properties of Permutations with CGFs
6.6 Inversions and Insertion Sorts
6.7 Left-to-Right Minima and Selection Sort
6.8 Cycles and In Situ Permutation
6.9 Extremal Parameters
CHAPTER SEVEN:STRINGS AND TRIES
7.1 String Searching
7.2 Combinatorial Properties of Bitstrings
7.3 Regular Expressions
7.4 Finite-State Automata and the Knuth-Morris-Pratt
Algorithm
7.5 Context-Free Grammars
7.6 Tries
7.7 Trie Algorithms
7.8 Combinatorial Properties of Tries
7.9 Larger Alphabets
CHAPTER EIGHT: WORDS AND MAPS
8.1 Hashing with Separate Chaining
8.2 Basic Properties of Words
8.3 Birthday Paradox and Coupon Collector Problem
8.4 Occupancy Restrictions and Extremal Parameters
8.5 Occupancy Distributions
8.6 Open Addressing Hashing
8.7 Maps
8.8 Integer Facterization and Maps
List of Theorems
Index
前言/序言
算法分析导论(英文版) 电子书 下载 mobi epub pdf txt
电子书下载地址:
相关电子书推荐:
- 文件名
- 中国科技典籍选刊(第二辑):历引三种 李亮
- 华图2018人民警察考试教材专业科目公安基础知识教材历年真题预测试卷招警考试用书2018公安素质测试
- 神秘的大脑:每天30秒探索令人兴奋的50个神经科学理念 科普读物 书籍
- 中公版·2018公务员录用考试专项教材:数量关系
- 昆虫记-“慢读”系列
- 约翰·汤普森简易钢琴小品选:交响乐队伴奏版3(附CD一张)
- 量子创造力:量子思维,富于创造力 9787229123024
- 古乐之美+乐之本事 古典乐聆赏入门 精装全两册
- 满58包邮 未来架构师(上、下) 9787540783747 《未来架构师》节目组著 漓
- 巴赫两首小提琴与通奏低音奏鸣曲(中外文对照)
- {RT}日常生活中的科学2000个科学知识-(美)博比克,郎淑华 上海科学技术文献出版社
- 音之源丛书:乐理视唱练耳考级教程第4级共2册(附光盘)
- 传情植物(花草物语)(精)
- 房地产交易制度政策
- 科学系列99丛书 电子大脑:计算机和机器人99