×
暂无评论
图文详情
  • ISBN:9787564173739
  • 装帧:一般胶版纸
  • 册数:暂无
  • 重量:暂无
  • 开本:32开
  • 页数:373
  • 出版时间:2017-10-01
  • 条形码:9787564173739 ; 978-7-5641-7373-9

本书特色

创造稳定的软件需要有效的算法,但是程序设计者们很少能在问题出现之前就想到。《算法技术手册》描述了现有的可以解决多种问题的算法,并且能够帮助你根据需求选择并实现正确的算法——只需要一定的数学知识即可理解并分析算法执行。相对于理论来说,本书更注重实际运用,书中提供了多种程序语言中可用的有效代码解决方案,可轻而易举地适合一个特定的项目。

内容简介

创造稳定的软件需要有效的算法,但是程序设计者们很少能在问题出现之前就想到。《算法技术手册》描述了现有的可以解决多种问题的算法,并且能够帮助你根据需求选择并实现正确的算法——只需要一定的数学知识即可理解并分析算法执行。相对于理论来说,本书更注重实际运用,书中提供了多种程序语言中可用的有效代码解决方案,可轻而易举地适合一个特定的项目。

目录

Preface to the Second Edition1. Thinking in Algorithms Understand the Problem Naive Solution Intelligent Approaches Summary References2. 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 References3. Algorithm Building Blocks Algorithm Template Format Pseudocode Template Format Empirical Evaluation Format Floating-Point Computation Example Algorithm Common Approaches References4. 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 References5. Searching Sequential Search Binary Search Hash-Based Search Bloom Filter Binary Search Tree References6. Graph Algorithms Graphs Depth-First Search Breadth-First Search Single-Source Shortest Path Dijkstra's Algorithm for Dense Graphs Comparing Single-Source Shortest-Path Options All-Pairs Shortest Path Minimum Spanning Tree Algorithms Final Thoughts on Graphs References7. Path Finding in AI Game Trees Path-Finding Concepts Minimax NegMax AlphaBeta Search Trees Depth-First Search Breadth-First Search A'Search Comparing Search-Tree Algorithms References8. Network Flow Algorithms Network Flow Maximum Flow Bipartite Matching Reflections on Augmenting Paths Minimum Cost Flow Transshipment Transportation Assignment Linear Programming References9. Computational Ge0metry Classifying Problems Convex Hull Convex Hull Scan Computing Line-Segment Intersections LineSweep Voronoi Diagram References10. Spatial Tree Structures Nearest Neighbor Queries Range Queries Intersection Queries Spatial Tree Structures Nearest Neighbor Queries Range Query Quadtrees R-Trees References11. Emerging Algorithm Categories Variations on a Theme Approximation Algorithms Parallel Algorithms Probabilistic Algorithms References12. 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 PerformanceA. BenchmarkingIndex
展开全部

预估到手价 ×

预估到手价是按参与促销活动、以最优惠的购买方案计算出的价格(不含优惠券部分),仅供参考,未必等同于实际到手价。

确定
快速
导航