搜索资源列表
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.
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
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
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
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
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
ACM.algorithm
- 各种算法模板(二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、)-Various algorithms templat
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
code
- 使用回溯法解决的典型问题的算法:骑士巡游问题,n皇后问题,0-1背包问题。 使用递归与分治策略解决的几个问题的算法:Hanoi塔问题和二分搜索技术。-Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem. Recursion and divide and conq
fenzhifa
- 分治法求数组中最大值和最小值,与普通方法比较-Divide and conquer method for the maximum and minimum values in the array, compared with the conventional method
binsearch
- 分治二分检索递归,算法设计与分析中的经典算法,值得大家参考学习。-Binary search recursive divide and conquer algorithm design and analysis of the classical algorithm, it is worth your learning.
suanfa3
- 这题是用分治算法中的折半查找,针对的是一个有序数组,把数组分而治之,把输入分成两个与原来相同的子问题,如果规模还太大,我们对这些子问题再做上述处理,直到这些子问题容易解决为止。这种算法是一种效率很高的算法,每一次循环,它都能将数组的规模减少到原来的半,其空间复杂度是O(log(n))次。-This question is divide and conquer algorithm binary search is for an ordered array, the array of divide