书名:计算机算法的设计与分析
编号:204160
ISBN:9787111177753[十位:7111177754]
作者:(美)Alfred V。Aho
出版社:机械工业出版社
出版日期:2006年01月
页数:470
定价:48.00 元
参考重量:0.610Kg
-------------------------
图书情况:正版二手旧书,绝不影响正常阅读!
绝无缺页少页,发货前再次检查,请放心购买!
* 内容提要 *
近年,在全球信息化大潮的推动下,我国的计算机产业迅猛发展,对专业人才的需求日益迫切。这对计算机教育界和出版界都既是机遇也是挑战;而专业教材的建设在教育战略上显得举足轻重。在我国信息技术发展时间较短的现状下美国发达国家在计算机科学发展的几十年积淀和发展的经典教材 仍有许多借鉴之处。。。。。。
* 图书目录 *
1 Models of Computation
1.1 Algorithms and their complexity
1.2 Random access machines
1.3 Computational complexity of RAM programs
1.4 A stored program model
1.5 Abstractons of the ARM
1.6 A primitive model of computation:the Turing machine
1.7 Relationship between the Turing machine and RAM models
1.8 Pidgin ALGOL-a high-level lanuage
2 Design of Efficient Algorlthms
2.1 Data structures:lists,queues ,and stacks
2.2 Set representations
2.3 Graphs
2.4 Trees
2.5 Recursion
2.6 Divide-and -conquer
2.7 Balancing
2.8 Dynamic programming
2.9 Epilogue
3 Sorting and Order Statistics
3.1 The Sorting problem
3.2 Radix Sorting
3.3 Sorting by comparisons
3.4 Heapsort-An O Comparison sort
3.5 Quicksort-an O expected time sort
3.6 Order statistics
3.7 Expected time for order statistics
4 Data Structures for Set Manipulation Problems
4.1 Fundamental operations on sels
4.2 Hashing
4.3 Binary search
4.4 Binary search trees
4.5 Optimal binary search trees
4.6 A simple disjoint-set union algorithm
4.7 Tree Structures for the UNION-FIND problem
4.8 Applications and extensions of the UNION-FIND algorithm
4.9 Balanced tree schemes
4.10 Dictionaries and priorty queues
4.11 Mergeable heaps
4.12 Concatenable queues
4.13 Partitioning
4.14 Chapter summary
5 Algorithms on Graphs
6 Matrix Multiplication and Related Operations
7 The Fast Fourier Transform and its Applications
8 Integer and Polynomial Arithmetic
9 Pattern-Matching Algorithms
10 NP-Complete Problems
11 Some Provably Intractable Problems
12 Lower Bounds on Numbers of Arithmetic Operations
Bibllography
Indes
* 文章节选 *
暂无相关介绍
* 编辑推荐与评论 *
暂无相关介绍
* 作者介绍 *
暂无相关介绍
-
暂无评论。