搜索资源列表
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
ChessBoard
- 大学期间的棋盘覆盖算法,采用分治策略,拥有图形界面。-University during the chessboard covering algorithm using a divide-and-conquer strategy, has a graphical interface.
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.
testfi
- 合并排序,是java实现的。算法思想是递归和分治。-Merge sort java implementation. The algorithm the thinking is recursive 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
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
jianzhifa
- 跟据减治法的大整数乘法,此方法是通过对大整数乘法的改进,运行时间更短,跟有效率的算法-According to conquer reduction of large integer multiplication, this method is improved by a large integer multiplication, the running time is shorter, with the efficiency of the algorithm
gaijin-fenzhifa
- 此为对分治法大整数相乘的一个改进,能够给对刚开始学习算法的人一个了解的机会-This is an improved large integer multiplication of divide-and-conquer method to the beginning of the learning algorithm an understanding of the opportunity
Majority
- 众数问题。使用分治思想处理。对于给定的由n 个自然数组成的多重集S,编程计算S 的众数及其重数。-Public a few problems. Deal with the idea of divide-and-conquer. Calculated for a given n natural numbers multiset S, programming S plural of multiplicity.