搜索资源列表
MergeSort
- 归并排序的算法。利用分而治之策略来对数组进行排序-Merge Sort algorithm. Divide-and-conquer strategy to sort the array
merge_sort
- 分治排序算法，对N个输入整形值进行递归分治排序，时间复杂度为NlogN-Divide-and-conquer sorting algorithm, recursive divide-and-conquer sort of N input integer value, the time complexity of NlogN
Cpp1
- 该程序利用了分治法计算多项式乘积，同时与没有用分治法的方法进行了比较-The program utilizes a divide-and-conquer method to calculate the polynomial product
Verilog-Reference-routines
- verilog 参考例程。适合初学者学习，深入浅出，由简到难，逐步深化，各个击破。 -verilog Reference routines. For beginners learning, easily understood, by Jane to difficult, and gradually deepening, divide and conquer.
fengzhisuanfa
- 分治算法代码以比较为基础的排序时间的下界-The lower bound of the divide and conquer algorithm code to comparison-based sorting time
MaxNSubmax
- 以递归分治思想，同时查找S串中的最大元和次大元。-Realize querying the max and submax number in a string S with divid and conquer.
MaxAndMin
- 递归分治思想实现S串中同时求出最大元和最小元。-with divid and conquer， to find out the max and min number in the string S.
code
- 3道分治算法题目以及解析。题目为图片，对应题目名有对应程序，在C/C++语言编译环境中测试通过。-3 topics as well as parsing of divide-and-conquer algorithm. Subject to the pictures corresponding topic name corresponding to the program, the test passed in the C/C++ language compiler environment.
Sutherland-Hodgman
- 基于divide and conquer策略的Sutherland-Hodgeman多边形裁剪算法-Sutherland-Hodgeman polygon clipping algorithm based on the strategy of divide and conquer
zuijindui
- 该代码采用分治法解决在平面内求最近的点对的方法-The code uses a divide-and-conquer method to solve the nearest point on the plane and
Select
- 选出数组中第k小元素 给定一个随机数组 用分治法-Elect the k-th smallest element in the array is given a random array of divide and conquer
point
- 用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方-Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity)
Attachments_2012_12_11
- Distinguish the similarity between dynamic programming and divide and conquer design techniques.
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
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
DFT-DaC
- Matlab implementation of the algorithm to compute the Discrete Fourier Transform using the Divide Conquer approach, as described in the book Digital Signal Processing of the autors John G. Proakis and Dimitris K. Manolakis.-Matlab implementation of t