搜索资源列表
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
src
- 征服PYTHON--语言基础与典型应用光盘-Conquer PYTHON- language base and the typical application of CD-ROM
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
Luncher
- Co luncher for conquer privite server
co
- ramdan yahe and my love
LCS.tar
- LCS匹配算法,divide and conquer LCS-LCS matching algorithms, divide and conquer LCS
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
AlgorithmCode
- C++版本的各类算法源代码，包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
Quicksort
- 基于分治算法的快速排序。编程工具vc++6.0.时间复杂度O（nlogn）-Divide and Conquer Algorithm Quicksort
Mergesort
- 归并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。 -Merge sort merge operation is based on an efficient sorting algorithm. This method used divide and conquer (Divide and Conquer) a very typical applications.
project2
- 用c语言做分治法之循环赛日程表，由于水平有限，我不知道错在哪里？请指教！-With the c language to divide and conquer the round-robin schedule, due to limited, I do not know wrong? Please advise!
The-divide-and-conquer-algorithm
- 分治算法求解两个有序数组的中位数，求解过程比较详细-Divide and conquer algorithm for solving two ordered arrays median
分治法
- 分治法的详细说明，比较简单易懂，哈哈哈哈(A detailed descr iption of the divide and conquer method)
cq
- cq_sql database conquer landers database
LordsRoad Fixed By Amjad V 2
- 征服新版模拟器源代码，V2版,能正常编译(Conquer the new version of the simulator source code, V2)