Location:
Search - DivConquer
Search list
Description: 算法实验:1 分治法在数值问题中的应用
——最近点对问题 2 减治法在组合问题中的应用——8枚硬币问题 3 变治法在排序问题中的应用——堆排序 4 动态规划法在图问题中的应用——全源最短路径问题
-Algorithm experiment: 1 divided numerical problems in the application- the nearest point to question 2 by governance problems in the application portfolio- 8 coins 3 Variable governance issues in order of application- HEAPSORT 4 dynamic programming problems in the application map- the whole question of the source of the shortest path
Platform: |
Size: 287744 |
Author: 邱名楷 |
Hits: