搜索资源列表
POINT
- 用分治法找一个平面内的最接近点对。时间复杂度为O（nlogn）.-Using a divide and conquer to find the closest point of the plane pair. Time complexity is O (nlogn)
CPair
- 分治法寻找最接近点对,内附测试文件，算法分析与设计作业-Partition method to find the most close point ，Enclosed test files, the algorithm analysis and design work
divide.rar
- 分治法求解最近点对问题 求最近点对的分治算法实现,输入点对，输出最近点,Sub-rule method for nearest point on the nearest point on the issue of sub-rule algorithm, input points, output nearest point
thecalendarofound-robincompeti
- 对分治法中常见的应用问题-循环赛日程表设计问题分析实现,On the separation of the application of common law issues- the design of round-robin schedule analysis to achieve
polynome.rar
- 多项式相乘的两种算法：直接相乘，分治法相乘,Polynomial multiplication of two algorithms: Direct multiply, multiply divided Act
fenzhifa.rar
- 分治法的基本思想，掌握递归程序编写方法；使用分治法编程，求解线形序列中第k小元素。,Separation of the basic ideas, grasp the recursive programming methods the use of sub-rule law programming, solving linear sequence of the first k small element.
nearestPointPair
- 给定一个点数组，比较求解最近点对的一般算法和分治法的效率。-Given a point group, compared to solve the nearest point on the general algorithm and divide and conquer efficiency.
large_integer
- VC++ 分治法大整数乘法-VC++ divide and conquer large integer multiplication
dazhengshu
- 本人上传的是用分治法实现的大整数算法，采用的是数组形式。-I uploaded is to use divide and conquer to achieve a large integer arithmetic, using the array form.
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
analysys-and-design-of-algorithm-ppt
- 我上课用的计算机算法设计与分析的电子教案，内容包括了最基本的分治法，贪心法，动态规划法，-I class computer algorithms used in design and analysis of electronic lesson plans, including the most basic sub-rule law, greedy method, dynamic programming method,
Chessman
- 分治法经典问题，棋子移动问题，在规定的规则内移动棋子。-Classic problem of sub-rule law, chess mobile issues, the rules in the pawn move.
quick
- 用分治法对100个数进行排序，排序前从文件中读出数据-Treatment with sub-100 number to sort, sort读出数据from the document before
pointNear
- 分治法解决最近点对问题，包括两种情况，考虑边界内四个点-Sub-rule method to solve the nearest point on the issues, including the two situations, consider the four-point boundary
2-7
- 计算机算法的士兵战队问题，用分治法实现，运行正确-Computer algorithms soldiers战队problem, with sub-rule method, run the correct
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
sort
- 快速排序 算法题 有运行结果 分治法思想 二分搜索技术-Quicksort Algorithm title run results are thinking of governance law dichotomy search technology
findk
- 用分治法实现找K小元素-With sub-rule method to find a small element of K
Strassen
- 用分治法和递归的思想，实现Strassen矩阵相乘-With sub-rule law and recursive thinking, to achieve Strassen matrices
main
- 安排比赛 用分治法实现 可以重复输入比赛队数，排版美观。 -Competition arrangements with sub-rule method can be re-enter the team number, layout aesthetics.