搜索资源列表
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
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
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
hongheishu
- 分治法实现三维最接近点对问题,对分治法的学习有很大的帮助-Divide and conquer method to achieve three-dimensional nearest point of the problem, divide and conquer method for learning a great help
strassen-web
- 算法课中的矩阵乘法,strassen问题求出几个矩阵的乘积,用divide and conquer思想-Implement the Strassen algorithm algorithm for MatrixMultiplication problem in your favourite language, and compare the performance with grade-school method.
merge-and-count
- 完成sort and count算法,是算法分析当中devide and conquer中的一道题-The attached file Q5.txt contains 100,000 integers between 1 and 100,000 (each row has a single integer), the order of these integers is random and no integer is repeated. 1. Write a program to
divide-and--conquer
- 实现大整数相乘,时间复杂度n(logn),c++源码-Achieve a large integer multiplication, time complexity n (logn), c++ source
closest_pair
- 分治法思想,求最邻近点对,考虑将所给的n个点的集合S分成2个子集S1和S2,每个子集中约有n/2个点,然后在每个子集中递归地求其最接近的点对-Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its
voronoi
- Voronoi Diagram算法实现主要运用分治法和凸包的方法来实现。 分治法: 1) 该问题的规模缩小到一定的程度就可以容易地解决 2) 该问题可以分解为若干个规模较小的相同问题,即该问题具有最优子结构性质。 3) 利用该问题分解出的子问题的解可以合并为该问题的解; 4) 该问题所分解出的各个子问题是相互独立的,即子问题之间不包含公共的子问题。 -Voronoi Diagram algorithm is mainly using the method of pa
qsort
- 分治递归实现的快速排序算法 时间复杂度nlogn -Divide and conquer recursive quicksort algorithm time complexity nlogn
chessboard-coverage-of-c-code
- 利用分治策略对棋盘覆盖问题进行求解,用c语言来实现。-Using divide and conquer strategy chessboard coverage of c code
cuosp_4267
- A Conquer 4267 private server codes
Emulator
- Conquer 5017 emulator
convex_hull
- 凸包问题的算法实现,graham算法实现,分治算法以及暴力算法,有简单图形界面-Convex Hull algorithm problem, graham algorithm, divide and conquer algorithms and violence algorithm, a simple graphical interface
cPP
- 关于二部图、线段数、树状数组、树的分治的一些POJ题目的解答-About two figure, the number of segments, Fenwick tree, the tree of divide and conquer some POJ topic answers
My_L
- L型骨牌(棋盘覆盖问题) -算法分析之分治策略 算法分析与设计 课程中分治策略的典型例子,采用MFC文档编程可视化实现算法; 能够手动进行对棋盘的颜色填充,并能显示棋盘中的填充数值。 由于这是课程作业,时间紧而赶制的,封装性可能比较差。 我用的版本是C++6.0的老版本,静态链接库,其中的exe可以直接运行。-L-type domino (chessboard coverage problem) - divide and conquer strategy algorithm algorith
Mergesorting
- 归并排序算法是建立在归并操作上的一种有效的排序算法。该算法是采用分治法的一个非常典型的应用。-Merge sorting algorithm is based on an efficient merge operation sorting algorithm. The algorithm is a very typical application using the divide and conquer method.
MergeSort
- c++的归并排序算法,改算法是用c++编写的,其中用到了递归的思想,和分治法的思想,方便大家参考学习。-c++ mergesort algorithm, which is written by c++, which uses a recursive thinking, and thinking divide and conquer, to facilitate reference study.