搜索资源列表
searchmin
- 根据分治算法策略，来实现对一个系列中最小数的查找．-under the divide-and-conquer strategy to achieve a series of the smallest number of search.
最近点对问题，分别用蛮力法和分治法进行了求解
- 最近点对问题，分别用蛮力法和分治法进行了求解，算法已经做过优化-Nearest point on the issue, respectively, and with brute force method for solving divide and conquer algorithm optimization has been done
NCoinsProblem
- n枚硬币问题，采用分治法中的三分算法，很好的解决了n个硬币的问题-n coins problem, using divide and conquer algorithm in the third, a good solution to the problem of n coins
nearestPointPair
- 给定一个点数组，比较求解最近点对的一般算法和分治法的效率。-Given a point group, compared to solve the nearest point on the general algorithm and divide and conquer efficiency.
addition3
- divide and conquer method of assigning one processor to each node in a tree for adding numbers (Lecture 6 Chapter 4 section 4.1.2) in terms of communication, computation, overall parallel execution time, speedup, and efficiency.
CoAccountServerKeygensrc
- Conquer Acc server Cracker
src
- 征服PYTHON--语言基础与典型应用光盘-Conquer PYTHON- language base and the typical application of CD-ROM
Loader
- server data & conquer.exe for patsh 5095
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
suanfa
- 常用算法,为初学者服务,简单易懂,常用的算法设计方法： 数值算法：迭代法、递归法、插值法等； 非数值算法：分治法、贪婪法、回溯法等。-Commonly used algorithms, for beginners service, easy to understand, common algorithm design methods: numerical algorithms: iterative method, the recursive method, interpolation m
Divfuntion
- 算法分析实验 算法分析分治法 最近点对问题-Experimental analysis of algorithms analysis of algorithms divide and conquer the nearest point of the problem
suanfa
- 编程实现最大子段和问题的求解（分别采用分治法和动态规划法求解）。-Programming the largest sub-segment and the problem solving (respectively divide and conquer and dynamic programming method to solve).
qi_pan
- 用C++语言编写的残缺棋盘问题的分治法源代码，很完整，可直接编译运行。-Using C++ language problems and incomplete chessboard divide and conquer the source code, it is complete, can be directly compiled to run.
ConquerServerSource
- 征服服务端源代码 什么版本自己去研究,不过可以肯定是2.0以上版本的外国源代码-Conquest of what version of server-side source code for their own to study, but you can certainly be 2.0 or above versions of the foreign source code
co
- ramdan yahe and my love
LCS.tar
- LCS匹配算法,divide and conquer LCS-LCS matching algorithms, divide and conquer LCS
NearestPoint
- 最近点对问题是许多算法书籍必有得一个要探讨的问题，本人基于王晓军的《算法设计与分析》实现了分治法及传统法的图形化演示程序，大家可以看到两者的算法性能的比较。-The nearest point of the problem is that many books there must be a method to explore the question, I based Wang Xiaojun' s " Algorithm Design and Analysis of"
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
MINMAX
- find min or max by Divide and conquer