搜索资源列表
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.
ChessBoard
- 大学期间的棋盘覆盖算法,采用分治策略,拥有图形界面。-University during the chessboard covering algorithm using a divide-and-conquer strategy, has a graphical interface.
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)
testfi
- 合并排序,是java实现的。算法思想是递归和分治。-Merge sort java implementation. The algorithm the thinking is recursive divide-and-conquer.
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.
DistanceSmallestPoints
- 通过分治策略,在O(nlogn)时间复杂度内,找到二维平面区域内距离最小的点对。-Divide-and-conquer strategy, the time complexity of O (nlogn), find the area of two-dimensional plane distance smallest point on.
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
conquer-and-divide-algorithm
- 本章描述了讲解了分治算法的基本思想和设计过程以及原理-Explain the basic idea and design process as well as the principle of divide and conquer algorithm described in this chapter
maze
- 分治算法,走迷宫问题,0可通过,1不可通过。-Divide and conquer algorithms, Maze problem by, not by.
IntegerMultiply
- 算法分析与设计 用递归分治算法解决大整数乘积问题(java源码)-Algorithm Analysis and Design Recursive divide and conquer algorithm to solve the problem of large integer multiplication. (Java source code)
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
SUANFAPPT
- 常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) -Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm
Shell-Sort
- 谢尔排序可以看作是一种插入排序的扩展方法与插入排序法相同的是,它们都是可以看作是一个个新的元素插入到已排好的数组里面的不同点是,在普通的插入排序法中,它是一个个元素比较,而在Shell s Sort中,相对多了一个步骤,改了一个步骤,其实两个合起来的改动就是多了一个概念,一个分治的概念,从代码实现的角度来看的话,就是多了一个调整步进的变量。-The Rochelle sort can be seen as an extension method of insertion sort and ins
stooge_sort
- 桶排序算法,分治算法,输入一串数字,输出他们从小到大的排序-Bucket sort algorithm, divide-and-conquer algorithm, input a string of numbers, the output from small to large order
suanfa
- 算法程序与设计试验中的经典算法的源代码:像是分治递归,贪心,回溯等。-Algorithm design test of the classical algorithm source code: such as divide and conquer recursion, greedy, backtracking.
search
- 利用分治算法,在大小分别为m和n的两个有序序列中,在单元时间内,用一个O(lg m + lgn) t 算法在两个序列中计算出第k大的元素-failed to translate
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
HalfSetAlgorithm
- 利用备忘录策略,采用递归分治方法实现求解半数集问题-Use memo strategies, using recursive divide and conquer method to solve half the problem set