書馨卡幫你省薪 2024個(gè)人購書報(bào)告 2024中圖網(wǎng)年度報(bào)告
歡迎光臨中圖網(wǎng) 請 | 注冊

算法技術(shù)手冊-第2版-(影印版)

出版社:東南大學(xué)出版社出版時(shí)間:2017-10-01
開本: 32開 頁數(shù): 373
中 圖 價(jià):¥72.0(7.5折) 定價(jià)  ¥96.0 登錄后可看到會(huì)員價(jià)
加入購物車 收藏
運(yùn)費(fèi)6元,滿39元免運(yùn)費(fèi)
?新疆、西藏除外
本類五星書更多>
買過本商品的人還買了

算法技術(shù)手冊-第2版-(影印版) 版權(quán)信息

算法技術(shù)手冊-第2版-(影印版) 本書特色

創(chuàng)造穩(wěn)定的軟件需要有效的算法,但是程序設(shè)計(jì)者們很少能在問題出現(xiàn)之前就想到。《算法技術(shù)手冊》描述了現(xiàn)有的可以解決多種問題的算法,并且能夠幫助你根據(jù)需求選擇并實(shí)現(xiàn)正確的算法——只需要一定的數(shù)學(xué)知識即可理解并分析算法執(zhí)行。相對于理論來說,本書更注重實(shí)際運(yùn)用,書中提供了多種程序語言中可用的有效代碼解決方案,可輕而易舉地適合一個(gè)特定的項(xiàng)目。

算法技術(shù)手冊-第2版-(影印版) 內(nèi)容簡介

創(chuàng)造穩(wěn)定的軟件需要有效的算法,但是程序設(shè)計(jì)者們很少能在問題出現(xiàn)之前就想到!端惴夹g(shù)手冊》描述了現(xiàn)有的可以解決多種問題的算法,并且能夠幫助你根據(jù)需求選擇并實(shí)現(xiàn)正確的算法——只需要一定的數(shù)學(xué)知識即可理解并分析算法執(zhí)行。相對于理論來說,本書更注重實(shí)際運(yùn)用,書中提供了多種程序語言中可用的有效代碼解決方案,可輕而易舉地適合一個(gè)特定的項(xiàng)目。

算法技術(shù)手冊-第2版-(影印版) 目錄

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
展開全部
商品評論(0條)
暫無評論……
書友推薦
本類暢銷
編輯推薦
返回頂部
中圖網(wǎng)
在線客服