搜索资源列表
algorithm
- 关于常用的几种算法介绍1、单源最短路径；2、递归与分治；3、贪心算法；4、动态规划；5、回溯法；6、分支限界法-On several commonly used algorithm introduced a single-source shortest path 2, recursion and divide and conquer 3, the greedy algorithm 4, dynamic programming 5, backtracking 6, branch and
algorith4
- 用分治法解决最近点对问题，就是将一个问题分解两个子问题，然后递归处理子问题，然后合并求出最短距离-Solve the problem closest point using divide and conquer method is to decompose a problem of two sub-problems, and then recursively processing sub-problems, and then find the shortest distance merge
chapter-2
- 算法设计与分析的 第2章 递归与分治策略.pdf-Design and Analysis of Algorithms Chapter 2 Recursion and divide and conquer strategy. Pdf
int_divide_SA13006029
- 整数因子问题的C语言源代码 计算机算法设计与分析中的题目 递归与分治算法-C language source code for a computer algorithm design and analysis topics recursive divide and conquer algorithm with integer factor issues
suanfa
- 利用分治算法和蛮力算法求最近点对的长度问题-Use divide and conquer algorithm and a brute-force algorithm for the nearest point on the length of the problem
fenzhifa
- 计算机算法分析里面分治法中很多算法的源码-Computer algorithm analysis, many of which divide and conquer algorithm source code
closestpair
- 在visual C++环境中，使用分治策咯实现最邻近点对的查找，并返回最邻近点对距离的平方-In visual C++ environment using divide and conquer tactics to achieve find the nearest point, and returns the nearest point on the square of the distance
2233111
- 采用分治法、动态规划算法实现0-1背包问题的求解；动态演示算法的的实现过程。要求演示界面友好、生动，易于对算法的理解-Divide and conquer, solved using dynamic programming algorithm to achieve the 0-1 knapsack problem process dynamic demonstration algorithm. The demonstration interface is friendly and vivid,
Large-integer
- 大整数，蛮力破解，分治法，改进分治法。程序清晰易懂，有利于帮助理解-Large integer, brute-force, divide and conquer, divide and conquer improvements. Clear and understandable procedures, could help to understand
algorithm
- 图包问题的多种解法，python实现，蛮力、gramham、分治-Many kinds of solutions, the python package diagram, brute force, Gramham, divide and conquer
Decrease-and-Conquer
- 该文章主要研究了依靠减治技术的各搜索算法，从基本搜索到对基本搜索改进，最后探讨了启发式的搜索，逐步深入，从而加深对搜索和减治法的理解-The paper studies the reduction treatment technologies rely on various search algorithms, basic search to search for basic improvements, and finally discuss the heuristic search, the
MaxSubSum
- 用三种方法解决最大子序列和问题，分别是基本方法，分治算法和动态规划算法，算法复杂度不断提高-Three methods were used to solve sequence and the biggest problem, respectively is the basic method and divide and conquer algorithm and dynamic programming algorithm, the complexity of the algorithm is i
fenzhi
- 凸包求解算法。 实现基于枚举方法的凸包求解算法 实现基于Graham-Scan的凸包求解算法 实现基于分治思想的凸包求解算法 对比三种凸包求解算法 -Convex hull algorithm. Based on Convex Hull algorithm enumeration method Based on Graham-Scan convex hull algorithm Based on Divide and Conquer convex hull alg
分治法求最大子数组以及其对应的下标
- 分治法应用分治法求最大子数组以及其对应的下标分治法求最大子数组以及其对应的下标(Application of divide and conquer therapy)