算法技术手册 编程语言 作者
none
￥ 51.45 5.4折 ￥ 96 全新
库存4件
北京丰台
认证卖家担保交易快速发货售后保障
作者作者
出版社东南大学出版社
ISBN9787564173739
出版时间2017-10
版次1
装帧平装
开本16
页数373页
字数423千字
定价96元
货号xhwx_1201590094
上书时间2024-12-03
- 在售商品 暂无
- 平均发货时间 27小时
- 好评率 暂无
商品详情
- 品相描述：全新
- 正版特价新书
- 商品描述
-
目录：
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 buil blocks
algorithm temte format
eudocode temte format
empirical evaluation format
floating-point putation
example algorithm
mon approaches
references
4. sorting algorithms
transition sorting
selection sort
heap sort
partition-based sorting
sorting without parisons
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
paring single-source shortest-path options
all-pairs shortest path
minimum spanning tree algorithms
final thoughts on graphs
references
7. path fin in ai
game trees
path-fin concepts
minimax
negmax
alphabeta
search trees
depth-first search
breadth-first search
asearch
paring search-tree algorithms
references
8. work flow algorithms
work flow
mamum flow
bipartite matching
reflections on augmenting paths
minimum cost flow
transshipment
transportation
assignment
linear programming
references
9. putational ge0metry
classifying problems
convex hull
convex hull scan
puting line-segment intersections
linesweep
voronoi diagram
references
10. spatial tree structures
nearest neior queries
range queries
intersection queries
spatial tree structures
nearest neior queries
range query
quadtrees
r-trees
references
11. emerging algorithm categories
variations on a theme
appromation algorithms
parallel algorithms
probabilistic algorithms
references
12. epilogue： principles of algorithms
know your data
dee 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 appromate solutions when sible
add parallelism to increase performance
a. benchmarking
index
内容简介：
创造稳定的软件需要有效的算法，但是程序设计者们很少能在问题出现之前想到。算法技术手册描述了现有的可以解决多种问题的算法，并且能够帮助你根据需求选择并实现正确的算法——只需要的数学知识即可理解并分析算法执行。相对于理论来说，本书更注重实际运用，书中提供了多种程序语言中可用的有效代码解决方案，可轻而易举地适合一个特定的项目。
作者简介：
t海涅曼，伍斯特理工学院计算机科学系副教授，他还担任了2005年基于组件的软件工程靠前研讨会的议程。加里波利斯，伍斯特理工学院实践教授，他还是headfirtobject0rlentedanalyianddeigrl一书的合著者。斯坦利塞克欧，在将近四十年的时间里，先后在knoxville伍斯特、蒙特利尔、重庆、洛桑以及巴黎的数所大学中任教。
— 没有更多了 —
以下为对购买帮助不大的评价