搜索资源列表
qipanfugai_CPP
- 用C++编写的棋盘覆盖问题的解决，其中有非常清楚的注释，帮助学习者了解分治法在类似问题中的应用-Board cover solution written in C++, which has a very clear comments to help students understand the divide and conquer those problems
qipanfugai_matlab
- 用matlab编写的棋盘覆盖问题的解决，有清楚的注释，帮助学习者了解分治法在类似问题中的应用-Matlab prepared by the board covering problems, clear notes, to help students understand the divide and conquer similar problems
Voronoi
- 维诺图的实现，应用分治法实现维诺图，代码详细有注释-Voronoi come true
11
- 算法求最近对问题,通过分治法求n个点的最近对问题-the problem of the nearest point
MergeSort
- 归并排序算法，该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。-Merge sort algorithm, which is a very typical application using the divide and conquer method (Divide and Conquer) is.
MaxMinDemon
- 计算一个数组中的最大最小值，分别使用直接计算和分治法计算，利用C#实现。-Maximum and minimum calculation in an array, were calculated using the direct calculation and divide and conquer, the use of C# implementation.
new--2
- 维诺图 分治法 特别的实现方法 速度为n的平方及-Voronoi
fenzhifa
- 计算机算法分析里面分治法中很多算法的源码-Computer algorithm analysis, many of which divide and conquer algorithm source code
MergeSort
- 归并排序，运用分治法对数组内容进行排序。-Merge sort to sort the array, using the method of content.
an
- 通过分治法的思想，用户输入a值和n值，输出a的n次幂的值-a n
2233111
- 采用分治法、动态规划算法实现0-1背包问题的求解；动态演示算法的的实现过程。要求演示界面友好、生动，易于对算法的理解-Divide and conquer, solved using dynamic programming algorithm to achieve the 0-1 knapsack problem process dynamic demonstration algorithm. The demonstration interface is friendly and vivid,
Matrix-multiplication-
- 矩阵乘法，分治法，可以直接使用，程序简单-Matrix multiplication
K-th-smallest-element
- 第k小元素，使用分治法，程序简单易懂,可以直接使用-K-th smallest element
Large-integer
- 大整数，蛮力破解，分治法，改进分治法。程序清晰易懂，有利于帮助理解-Large integer, brute-force, divide and conquer, divide and conquer improvements. Clear and understandable procedures, could help to understand
guibing
- 归并排序是建立在归并操作上的一种有效的排序算法,该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。-Merge algorithm
include
- 当要求解一个输入规模为n，且n的取值相当大的问题时，的，如果问题可以分成k个不同子集合，得到k个不同的可独立求解的子问题，其中1<k≤n，而且子问题与原问题性质相同，原问题的解可由这些子问题的解合并得出。那末，对于这类问题分治法是十分有效的。-When the solution of an input size n, and N values considerable problems when, if the problem can be into k different sub set
quickSort
- 基于分治法的快速排序方法,C语言实现方法。-Quick sort
gui-bing-pai-xu
- 归并排序是建立在归并操作上的一种有效的排序算法,该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。将已有序的子序列合并，得到完全有序的序列；即先使每个子序列有序，再使子序列段间有序。若将两个有序表合并成一个有序表，称为二路归并。-Merge sort is established in the merge operation a effective sorting algorithm. The algorithm is using the divide and co
fenzhifazuijnidiandui
- 分治法的应用，分治法求最近点对源码，编译无措，算法基础实验-The application of the method, divide and conquer method for the nearest point on the source code, compile flawless, algorithm based on the experiment
DAZHENGSHU-
- 分治法大正数运算支持1000位以内运算，不过自己可以很方便地改长度-Divide and conquer positive operation within 1000 bit support operations, but you can easily change the length of