搜索资源列表
dye-Divide-and-conquer
- Divide: the problem into a number of subproblems that are themselves smaller instances of the same type of problem. Conquer: Recursively solving these subproblems. If the subproblems are small enough, solve them straightforward. Combine:
large_integer
- VC++ 分治法大整数乘法-VC++ divide and conquer large integer multiplication
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
555666
- 征服私服要有的东西 /-Things have conquer私服/
PolygonClipping
- 基于divide and conquer策略的Sutherland-Hodgeman多边形裁剪算法的Matlab程序-Divide and conquer strategy based on the Sutherland-Hodgeman polygon clipping algorithm of Matlab procedures
Co2-Rev1
- Conquer Database working 100 percent-Conquer Database working 100 percent
Co2-Rev2
- Conquer Database v2 working
Co2-Rev3
- Conquer v3 Database working
Luncher
- Co luncher for conquer privite server
msdar
- Conquer online Source Code Patch 5165
houka
- Kings^OF^Binary Source File Conquer Online
unittestppt
- 单元测试理论PPT，分为四个部分：为什么需要单元测试？怎样征服可测性难题？怎样才能高效率测试？怎样保证测试效果？制作精良，内容精炼。-Unit test theory PPT, divided into four parts: Why unit test? How to conquer the testability problem? How can high-efficiency test? How to ensure test results? Produced, the content o
Convex_hull_problem
- 凸包问题( 分治法与穷举法+测试数据 )-Convex hull problem (divide and conquer and the exhaustive method+ test data)
Divide-and-Conquer-maxmin
- 分治策略 maxmin算法 求数组A[1...n]最大最小元素-Divide and Conquer maxmin
Divide-and-conquer-algorithm
- 分治算法是基于多分枝递归的一种算法设计模式。分治算法递归地把一个大问题分解为多个类型相同的子问题，直到这些子问题足够的简单能被直接解决。最后把这些子问题的解结合起来就能得到原始问题的解。-Divide and conquer algorithm is based on a multi-branch recursive algorithm design pattern. Divide and conquer algorithm recursively to a large problem into
recursive-divide-and-conquer
- 算法设计课件(第二章递归与分治)，主要讲述递归与分治-Algorithm courseware design (Chapter II recursive divide and conquer), focuses on the recursive divide and conquer
Impulses-Source-[conquer]
- [征服纵马江湖老端] Impulse s Source [支持百人]源代码。很稀有的哦！需要的下载-[To conquer the old horse itinerant end] Impulse' s Source [support the hundred] source code. Oh, very rare! Need to download
conquer-and-divide-algorithm
- 本章描述了讲解了分治算法的基本思想和设计过程以及原理-Explain the basic idea and design process as well as the principle of divide and conquer algorithm described in this chapter
divide-and-conquer-algorithm
- 利用分治策略求解时，所需时间取决于分解后子问题的个数、子问题的规模大小等因素，而二分法，由于其划分的简单和均匀的特点，是经常采用的一种有效的方法，例如二分法检索。-When solving using the divide and conquer strategy, the time required depends on the number of decomposed sub-problems, the size of sub-problems and other factors, but
Conquer(mysql)
- 征服5506版，带数据库，正常编译，能开区。(Conquer the 5506 edition, with database, normal compilation, can open area.)