书籍详情
算法题解(英文版)
作者:霍红卫编
出版社:高等教育出版社
出版时间:2004-09-01
ISBN:9787040146196
定价:¥35.00
购买这本书可以去
内容简介
本书提供了在学习现代计算机算法时经常会遇到的许多问题的答案,可以帮助读者更好地理解、掌握算法分析与设计课程。本书包括360多个练习题,这些练习题不仅涉及到一些经典问题,而且包括一些重要的应用程序中的热点问题,如文字处理中的段落排版、数据压缩、数据库系统和Internet搜索引擎等方面的算法问题,这些都是现代软件系统的基本组成部分。本书可作为高等学校计算机科学与技术类专业、数学及信息与计算科学专业本科生和研究生“算法分析与设计”课程的辅助教材,也可供其他专业涉及算法设计与应用的研究和开发人员学习参考。
作者简介
暂缺《算法题解(英文版)》作者简介
目录
Preface
Chapter 1 Mathematical Foundation
1.1 Growth of Functions
1.2 Recurrences
1.3 Exercises & Solutions
Chapter 2 Sorting and Selection
2.1 Sorting
2.2 Selection
2.3 Exercises & Solutions
Chapter 3 Data Structures
3.1 Elementary Data Structures
3.2 Dynamic Sets and Searching
3.3 Exercises & Solutions
Chapter 4 Advanced Data Structures
4.1 B-Trees
4.2 Binomial Heaps
4.3 Fibonacci Heaps
4.4 Data Structures for Disjoint Sets
4.5 Exercises & Solutions
Chapter 5 Advanced Design and Analysis Techniques
5.1 Divide and Conquer
5.2 Dynamic Programming
5.3 Greedy Algorithms
5.4 Amortized Analysis
5.5 Exercises & Solutions
Chapter 6 Graph Algorithms
6.1 Elementary Graph Algorithms
6.2 Minimum Spanning Trees
6.3 Single-Source Shortest Paths
6.4 All-Pairs Shortest Paths
6.6 Exercises & Solutions
Appendix
References
Chapter 1 Mathematical Foundation
1.1 Growth of Functions
1.2 Recurrences
1.3 Exercises & Solutions
Chapter 2 Sorting and Selection
2.1 Sorting
2.2 Selection
2.3 Exercises & Solutions
Chapter 3 Data Structures
3.1 Elementary Data Structures
3.2 Dynamic Sets and Searching
3.3 Exercises & Solutions
Chapter 4 Advanced Data Structures
4.1 B-Trees
4.2 Binomial Heaps
4.3 Fibonacci Heaps
4.4 Data Structures for Disjoint Sets
4.5 Exercises & Solutions
Chapter 5 Advanced Design and Analysis Techniques
5.1 Divide and Conquer
5.2 Dynamic Programming
5.3 Greedy Algorithms
5.4 Amortized Analysis
5.5 Exercises & Solutions
Chapter 6 Graph Algorithms
6.1 Elementary Graph Algorithms
6.2 Minimum Spanning Trees
6.3 Single-Source Shortest Paths
6.4 All-Pairs Shortest Paths
6.6 Exercises & Solutions
Appendix
References
猜您喜欢