搜索资源列表
divid
- divid算法，可用于分治法，对于数据结构的学习较有帮助-divid algorithm can be used to divide and conquer
1975ClosestPoint
- 维诺图分治法的经典论文，里面提出了如何使用分治法生成维诺图，值得研究-Voronoi diagram of divide and conquer classic paper, which proposed how to use a divide-and-conquer method to generate the Voronoi diagram, worthy of study
MatrixMultiply
- 用分治法和Strassen方法，并进行效率的比较，有图形界面，输出结果用log4j输出到文件中。-With partition and Strassen method, and comparison of the efficiency, has a graphical interface, using log4j output the results output to a file
matrix_compute
- 该程序用于计算矩阵的乘方和，采用算法设计中的分治法实现，计算速度快，算法复杂度低。-Involution of the procedures used to calculate the matrix using the divide and conquer algorithm design to achieve calculation speed, low complexity of the algorithm.
compute_lasfousnum
- 采用分治法快速求解拉斯斐切数。代码用C语言编程实现，可用于处理数学问题。-The divide-and-conquer method fast solving Lasifeiqie number. Code with C language programming, can be used to deal with mathematical problems.
fenzhifa
- 分治法排序。 分治策略是：对于一个规模为n的问题，若该问题可以容易地解决（比如说规模n较小）则直接解决，否则将其分解为k个规模较小的子问题，这些子问题互相独立且与原问题形式相同，递归地解这些子问题，然后将各子问题的解合并得到原问题的解。-Divide and conquer sort
Merge-sort
- 合并排序算法，使用分治法，VC++6.0下经典排序算法。-Merge sort algorithm using a divide-and-conquer method, VC++6.0 under classical sorting algorithms.
quick_sort
- 快速排序,算法课后写的，写对其进行划分，然后采用分治法递归使用。-quick sort
Cpp1
- 该程序利用了分治法计算多项式乘积，同时与没有用分治法的方法进行了比较-The program utilizes a divide-and-conquer method to calculate the polynomial product
zuijindui
- 该代码采用分治法解决在平面内求最近的点对的方法-The code uses a divide-and-conquer method to solve the nearest point on the plane and
FastSort
- 分治法实现快速排序，C++实现，可直接运行-a realization of fast sort
Select
- 选出数组中第k小元素 给定一个随机数组 用分治法-Elect the k-th smallest element in the array is given a random array of divide and conquer
Qipan
- 特殊方格必位于4个较小子棋盘之一中,其余3个子棋盘无特殊方格 用分治法解决棋盘覆盖问题算法接单明了。-Special grid must be located in one of the four smaller sub-chessboard, the remaining three sub-chessboard squares divide-and-conquer method to solve the chessboard coverage problem algorithm orders
point
- 最近点对问题，采用分治法，编译通过，代码正确-Nearest point problem using the divide-and-conquer method, the compiler through correct code
big
- 大整数乘法，编译通过，采用的是分治法，绝对正确-Large integer multiplication, compiled by the divide and conquer, absolutely right.
Strassen
- Strassen矩阵乘法，运用分治法，书上资料，编译通过-Strassen matrix multiplication using divide-and-conquer method book, compiled by
max_substring
- 用蛮力法、分治法等分别实现最大字段和问题-Use brute force method, partition method etc., achieve maximum field and problems
fenzhifa
- 通过使用分治法进行二分搜索,代码已验证可放心使用-Binary search by using the divide-and-conquer method, the code can be assured Verified ~ ~
tileboard
- 残缺棋盘算法 使用分治法求解，喜欢的可以参考-The mutilated checkerboard algorithm using a divide-and-conquer method to solve, like reference
fenzhifa2
- 分治法矩阵相乘函数，优化时间复杂度，简单递归调用-Divide and conquer matrix multiplication function