搜索资源列表
suanfashiyanbaogao
- 算法设计实验报告 递归与分治 和贪心算法-Recursive algorithm design lab report and the greedy algorithm with sub-rule
dye-Divide-and-conquer.ppt
- 动态规划算法及分治的思想在算法设计中的应用。-Dynamic programming algorithm and the ideological division in the algorithm design.
AlgorithmLectures
- 算法讲座：递归与分治策略，多种算法，配有相应例子插图，值得推荐的电子书。-Algorithm Lectures: recursive division strategy with a variety of algorithms, examples with the corresponding illustrations, the book worthy of recommendation.
SUANFAPPT
- 常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) -Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm
MergeSort
- 归并排序。二路归并排序的分治算法，用VC++6.0实现。-Merge sort. 2 merge sort of partition algorithm, using vc++ 6.0.
algorithm
- 以设计策略为主线，循序渐进地介绍了经典算法设计（包括分治、动态规划、贪心、回溯、迭代改进等算法）、NF完全理论、非精确型算法设计〔包括近似算法、参数化算法，随机算法），以及现代智能优化方法．强调算法思维与编程实践并重，注重运用算法技术解决实际工程问题。-In order to design strategy as the main line, gradual introduction of the classic algorithm design (including the partition
divide-and-conquer-algorithm
- 详细讲解了算法学习中的分治算法的原理，并附有详细的例题讲解和伪码-Explained in detail the algorithm of learning the principle of divide and conquer algorithm, with a detailed example to explain and pseudo-code
a1401
- 分治法将数字实现格雷码转换，运用分治策略。(The method will achieve the conversion of digital gray code, using divide and conquer strategy.)