搜索资源列表
fenzhifa
- 算法设计与分析基础（分治法） 算法设计与分析基础（分治法）-algorithm design and analysis of the basis (the partition) algorithm design and analysis of the basis (the partition)
guibinpaixu
- 是一个用C++编写的小程序它可以进行归并排序和二分查找，是一个分治法的实例-C is a small procedure to prepare it for sorting and merging two hours to find, is a partition of the examples of France
datastr2s5
- 分治法进行合并排序是一种很奇妙的排序方法-partition method combined ranking is a very intriguing sort of way
yakun
- 归并排序,算法分析与设计第二章分治法思想的归并排序算法实现,用C++写的.-merge sorting algorithm analysis and design of the second chapter ideological divide-and-conquer method of merging ranking algorithm, C writes.
kuaisu
- 快速排序,算法分析与设计第二章分治法思想的快速排序算法实现.-quick sort, algorithm analysis and design of the second chapter ideological divide-and-conquer method of quick sort algorithm.
eryi
- 设B是一个n×n棋盘，n=2k,(k=1,2,3,…)。用分治法设计一个算法，使得：用若干个L型条块可以覆盖住B的除一个特殊方格外的所有方格。其中，一个L型条块可以覆盖3个方格。且任意两个L型条块不能重叠覆盖棋盘
MatrixMult
- 用分治法解矩阵乘法(C++实现)-with the partition method for matrix multiplication (C achieved)
ArithmeticDesignMethod
- 此文章的算法有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法等等，有用的的人可以
分别用蛮力法、分治法、减治法求a的n次方
- 分别用蛮力法、分治法、减治法求a的n次方，并比较时间-Respectively with brute force method, partition method, reduce the power comes for a n, and more time
最近点对问题，分别用蛮力法和分治法进行了求解
- 最近点对问题，分别用蛮力法和分治法进行了求解，算法已经做过优化-Nearest point on the issue, respectively, and with brute force method for solving divide and conquer algorithm optimization has been done
searchK
- 分治法寻找第K小元素，包含具体程序和word文档。-Sub-rule method to find the first small element of K, including the specific procedures and word documents.
lcs2
- 用分治法求出两个字符串中的最长公共子序列，输出长度，并输出最终序列-Calculated by sub-rule 2 of the longest string common sub-sequence, the output length, and output the final sequence
fenzhifa
- 这是分治法的小程序,来自书本上的作业. 没什么大的改变.看看就好-This is a small sub-rule law procedures, from the books work. No big change. Look like
petroline
- 输油管道问题 计算机算法设计分析 分治法算法实现题-Computer Algorithm Design and Analysis of pipeline issues divide and conquer algorithm question
zuijindui
- 用蛮力法和分治法解最近对问题以及对算法时间性能及运行结果的分析 -And sub-rule by brute force method of solving the problem, as well as the recent performance of the algorithm and running time analysis of the results
aifenchazhao
- 利用分治法解决二分查找问题，这个程序可以输出结果。希望对大家有一定的帮助，谢谢了-The use of sub-rule method to deal with two minutes to find the problem, this program can output. We want to have some help, thank you
分治法
- 分治法的详细说明，比较简单易懂，哈哈哈哈(A detailed descr iption of the divide and conquer method)
Divide and conquer methed
- 利用分治法来解决找出n枚硬币中所含有的一枚假币问题(To solve the counterfeit coin problem in n coins by means of divide and conquer method)
01beibao_fenzhijiexian
- 分治法实现01背包问题，输入为即将放入背包的物品的重量和对应价值的数组，输出为放置物品的最优方案(Realization of 01 knapsack problem by divide and conquer method)
钻石矿工
- 算法设计中的钻石矿工问题在一座金字塔每块石头上都镶有一块钻石从金字塔的顶端向下收集钻石尽可能收集价值高的钻石，每层每次只能从一块砖斜向左下或斜向右下走到另一块砖上。设计算法求出获取的钻石最大价值及路径。（分治法）(The problem of diamond miner in algorithm design is set up on every stone in Pyramid. A diamond is collected from the top of Pyramid. Diamond i