搜索资源列表
Kmin.rar
- 求第K小元素（分治法实现） ,K for the first small element (sub-rule method)
polynome.rar
- 多项式相乘的两种算法：直接相乘，分治法相乘,Polynomial multiplication of two algorithms: Direct multiply, multiply divided Act
searchK
- 分治法寻找第K小元素，包含具体程序和word文档。-Sub-rule method to find the first small element of K, including the specific procedures and word documents.
nearestPointPair
- 给定一个点数组，比较求解最近点对的一般算法和分治法的效率。-Given a point group, compared to solve the nearest point on the general algorithm and divide and conquer efficiency.
ClosetPairs
- 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the probl
quick
- 用分治法对100个数进行排序，排序前从文件中读出数据-Treatment with sub-100 number to sort, sort读出数据from the document before
lcs2
- 用分治法求出两个字符串中的最长公共子序列，输出长度，并输出最终序列-Calculated by sub-rule 2 of the longest string common sub-sequence, the output length, and output the final sequence
C
- Some of the basic design of C language algorithm C语言的几种算法：自顶向下、逐步求精方法、简单排序算法、枚举法、迭代法、递推与递归法、分治法-Some of the basic design of C language algorithmC language of several algorithms: top-down, stepwise refinement method, a simple sorting algorithm, enum
Strassen
- 用分治法和递归的思想，实现Strassen矩阵相乘-With sub-rule law and recursive thinking, to achieve Strassen matrices
fenzhifa
- 这是分治法的小程序,来自书本上的作业. 没什么大的改变.看看就好-This is a small sub-rule law procedures, from the books work. No big change. Look like
Strassen
- 利用C++实现strassen矩阵乘法，即采用七次乘法的分治法。-The use of C++ realization of Strassen matrix multiplication, namely multiplication seven sub-rule method.
text
- 设B是一个n×n棋盘，n=2k,(k=1,2,3,…)。用分治法设计一个算法，使得：用若干个L型条块可以覆盖住B的除一个特殊方格外的所有方格。其中，一个L型条块可以覆盖3个方格。且任意两个L型条块不能重叠覆盖棋盘。-。。
ChessMulch
- 棋盘覆盖问题，用分治法算法求解的一个例子。-Cover board with sub-algorithm treatment of a case in point.
CSDNdatastructure
- 分治法求大数乘法的问题 等等一些算法分析-datastructure
NearestPoints
- 分别利用分治法及穷举法求解最近点对问题，输出查找结果及比较次数。-Use, respectively, sub-rule method and brute-force method for solving the nearest point of the problem, the output and compare the number of search results.
KitBag
- 分治法和蛮力法求解最近点对问题,不好意思中文传不了，改传背包问题了。-leastport
petroline
- 输油管道问题 计算机算法设计分析 分治法算法实现题-Computer Algorithm Design and Analysis of pipeline issues divide and conquer algorithm question
fenzhifazuiyoujiewenti
- 分治法解决最优解问题，很好很强大 分治法解决最优解问题，很好很强大-Divide and conquer the optimal solution to solve the problem, very good very strong Oita conquer the optimal solution to solve the problem, very good very strong
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
分治法
- 分治法的详细说明，比较简单易懂，哈哈哈哈(A detailed descr iption of the divide and conquer method)