搜索资源列表
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
raid
- POJ 2659 Raid 分治法解决两组点中距离最近的点对-POJ 2659 Raid divide-and-conquer method to solve the two sets of points to the nearest point on the
suanfafenxi
- 通过蛮力法,动态规划,分治法,三种方法实现求子段最大和。-Praying for Children segment and by the brute force method, dynamic programming, divide-and-conquer method, three methods.
merge_sort
- 归并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。首先考虑下如何将将二个有序数列合并。这个非常简单,只要从比较二个数列的第一个数,谁小就先取谁,取了后就在对应数列中删除这个数。然后再进行比较,如果有数列为空,那直接将另一个数列的数据依次取出即可-It is a algorithm of Merge sort,and it was realized by using c++.
DistanceSmallestPoints
- 通过分治策略,在O(nlogn)时间复杂度内,找到二维平面区域内距离最小的点对。-Divide-and-conquer strategy, the time complexity of O (nlogn), find the area of two-dimensional plane distance smallest point on.
divide1
- 最近点对问题:分治法解决 时间复杂度:O(nlogn)-the closest point problem "divide and conquer" time complexity:O(nlogn)
4267_conquer_source
- 征服4267_conquer_source源代码。稀有源代码。有兴趣可以研究,测试过了,完整可以单机或者联网测试-Conquer the 4267_conquer_source source code. The rare source code. Interest can be studied, tested, complete stand-alone or networked test
Divide-MergeSort
- 分治法描述归并/合并排序,附有文档详细说明。-The divide-and-conquer method described merge/merge sort, with document details.
divid-element-choose
- 算法练习:分治法实现元素选择,附有详细说明、解释。-Algorithms Exercise: Divide and Conquer element selection with detailed instructions, explain.
bianzhifa-cpkdate
- 算法练习:变治法实现cpk的约会问题,附有详细说明+ppt。-The dating algorithm practice of: Variable conquer achieve cpk, with detailed descr iptions+ppt.
aa
- 利用分治法,写一个二分检索的递归算法,在计算机上编程实现,同时进行时间复杂性分析。(要求用递归方法实现)-Divide-and-conquer method, write a recursive algorithm to retrieve a dichotomy, computer programming, and simultaneously the time complexity of the analysis. (Using recursive method to achieve)
youjuxuanzhi
- 邮局选址问题 采用线性时间选择算法 基于分治思想,采用文件输入方式 输出邮局选址坐标-The post office location problem using a linear time selection algorithm is based on the idea of divide-and-conquer, file input output post office location coordinates
Divide-and-ConqueraaMST
- 分治,最小生成树。自己做题的心得以及代码,希望可以对初学者起到一点作用。-Divide and conquer, minimum spanning tree
MergeSort
- 归并排序(Merge sort,即合并排序)是建立在归并操作上的一种有效的排序算法。该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。其时间复杂度为O(n)O(最优)、(nlog n)(最差)。-Merge sort (Merge sort, that is, merge sort) an efficient sorting algorithm is merge operation. The algorithm is a typical application of
maze
- 分治算法,走迷宫问题,0可通过,1不可通过。-Divide and conquer algorithms, Maze problem by, not by.
ACM.algorithm
- 各种算法模板(二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、)-Various algorithms templat
line_dandc
- Hideen line removal problen using Divide And Conquer Strategy
QuickSort
- 用快速排序(分治法),对序列{23,13,49,6,31,19,28}进行升序排列,适用于初学者,算法设计与基础,写的很通俗易懂-Quick sort (divide and conquer), the sequence {23,13,49,6,31,19,28} in ascending order, suitable for beginners, algorithm design and basic, very easy to understand
1005
- 要求用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出最邻近距离的平方 其中0<=x<10000,0<=y<10000,(x,y是整数) 点数1<n<=30000. Input 第一行表示点的数目n; 接下来的n行中,每一行依次表示点的x坐标,y坐标。 Output 输出n个点中最邻近点对距离的平方-Looking for n points in the nearest neighbor