搜索资源列表
最近点对问题，分别用蛮力法和分治法进行了求解
- 最近点对问题，分别用蛮力法和分治法进行了求解，算法已经做过优化-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
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.
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.
Select
- 选出数组中第k小元素 给定一个随机数组 用分治法-Elect the k-th smallest element in the array is given a random array of divide and conquer
DistanceSmallestPoints
- 通过分治策略，在O(nlogn)时间复杂度内，找到二维平面区域内距离最小的点对。-Divide-and-conquer strategy, the time complexity of O (nlogn), find the area of two-dimensional plane distance smallest point on.
medo
- 设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。 编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中-Let X [0: n- 1
main6
- C语言编写的命令行程序，通过蛮力法、动态规划、分治法求最大字段和，并进行算法效率比较。-C language command-line program, through brute force method, dynamic programming, divide and conquer method for maximum field and, and compare efficiency of the algorithm.