算法技术手册(美)乔治·T·海涅曼(George T.Heineman),(美)加里·波利斯(Gary Pollice),(美)斯坦利·塞克欧(Stanley Selkow) 著东南大学出版社
新华系统图书，正版特价新书！ 天津，河北，无锡，成都四大仓库发货，70%城市次达！
￥ 62 6.5折 ￥ 96 全新
库存4件
北京顺义
认证卖家担保交易快速发货售后保障
作者(美)乔治·T·海涅曼(George T.Heineman),(美)加里·波利斯(Gary Pollice),(美)斯坦利·塞克欧(Stanley Selkow) 著
出版社东南大学出版社
ISBN9787564173739
出版时间2017-10
装帧平装
开本16开
定价96元
货号1201590094
上书时间2023-02-12
商品详情
- 品相描述：全新
- 商品描述
-
作者简介
乔治·T·海涅曼，伍斯特理工学院计算机科学系副教授，他还担任了2005年基于组件的软件工程靠前研讨会的议程。
加里·波利斯，伍斯特理工学院实践教授，他还是《Head First Object-0rlented Analysis and Desigrl》一书的合著者。
斯坦利·塞克欧，在将近四十年的时间里，先后在Knoxville伍斯特、蒙特利尔、重庆、洛桑以及巴黎的数所大学中任教。
目录
Preface to the Second Edition
1. Thinking in Algorithms
Understand the Problem
Naive Solution
Intelligent Approaches
Summary
References
2. The Mathematics of Algorithms
Size of a Problem Instance
Rate of Growth of Functions
Analysis in the Best， Average， and Worst Cases
Performance Families
Benchmark Operations
References
3. Algorithm Building Blocks
Algorithm Template Format
Pseudocode Template Format
Empirical Evaluation Format
Floating-Point Computation
Example Algorithm
Common Approaches
References
4. Sorting Algorithms
Transposition Sorting
Selection Sort
Heap Sort
Partition-Based Sorting
Sorting without Comparisons
Bucket Sort
Sorting with Extra Storage
String Benchmark Results
Analysis Techniques
References
5. Searching
Sequential Search
Binary Search
Hash-Based Search
Bloom Filter
Binary Search Tree
References
6. Graph Algorithms
Graphs
Depth-First Search
Breadth-First Search
Single-Source Shortest Path
Dijkstras Algorithm for Dense Graphs
Comparing Single-Source Shortest-Path Options
All-Pairs Shortest Path
Minimum Spanning Tree Algorithms
Final Thoughts on Graphs
References
7. Path Finding in AI
Game Trees
Path-Finding Concepts
Minimax
NegMax
AlphaBeta
Search Trees
Depth-First Search
Breadth-First Search
ASearch
Comparing Search-Tree Algorithms
References
8. Network Flow Algorithms
Network Flow
Maximum Flow
Bipartite Matching
Reflections on Augmenting Paths
Minimum Cost Flow
Transshipment
Transportation
Assignment
Linear Programming
References
9. Computational Ge0metry
Classifying Problems
Convex Hull
Convex Hull Scan
Computing Line-Segment Intersections
LineSweep
Voronoi Diagram
References
10. Spatial Tree Structures
Nearest Neighbor Queries
Range Queries
Intersection Queries
Spatial Tree Structures
Nearest Neighbor Queries
Range Query
Quadtrees
R-Trees
References
11. Emerging Algorithm Categories
Variations on a Theme
Approximation Algorithms
Parallel Algorithms
Probabilistic Algorithms
References
12. Epilogue： Principles of Algorithms
Know Your Data
Decompose a Problem into Smaller Problems
Choose the Right Data Structure
Make the Space versus Time Trade-Off
Construct a Search
Reduce Your Problem to Another Problem
Writing Algorithms Is Hard-Testing Algorithms Is Harder
Accept Approximate Solutions When Possible
Add Parallelism to Increase Performance
A. Benchmarking
Index
相关推荐
— 没有更多了 —
以下为对购买帮助不大的评价