搜索资源列表
分治法java与c++的实现
- 分治法java与c++的实现
分别用蛮力法、分治法、减治法求a的n次方
- 分别用蛮力法、分治法、减治法求a的n次方，并比较时间-Respectively with brute force method, partition method, reduce the power comes for a n, and more time
最近点对问题，分别用蛮力法和分治法进行了求解
- 最近点对问题，分别用蛮力法和分治法进行了求解，算法已经做过优化-Nearest point on the issue, respectively, and with brute force method for solving divide and conquer algorithm optimization has been done
用分治法求第k小元素
- 用分治法求第k小元素 输入：程序从标准输入读入数据，第一行是一个整数n (1=<n<=100000)表示元素的个数，接下来的n行中每行有一个整数。最后一行是k，就是我们要找的第k小元素。 输出：针对每一组输入，输出一个结果，每个结果占一行。 例如： 输入 5↵ 123↵ 12↵ 1↵ 3↵ 4↵ 4↵ 输出： 12 ,Separation method using the first k elements in small
searchK
- 分治法寻找第K小元素，包含具体程序和word文档。-Sub-rule method to find the first small element of K, including the specific procedures and word documents.
lcs2
- 用分治法求出两个字符串中的最长公共子序列，输出长度，并输出最终序列-Calculated by sub-rule 2 of the longest string common sub-sequence, the output length, and output the final sequence
fenzhifa
- 棋盘覆盖问题，是用分治法实现的。基本上全是数字实现的。虽然简单，但是这是为了说明一个算法的设计问题-Board cover problem is the use of sub-rule method to achieve. Basically, all the figures attainable. Although simple, but this is to illustrate the design of an algorithm
DivConquer
- 算法实验:1 分治法在数值问题中的应用 ——最近点对问题 2 减治法在组合问题中的应用——8枚硬币问题 3 变治法在排序问题中的应用——堆排序 4 动态规划法在图问题中的应用——全源最短路径问题 -Algorithm experiment: 1 divided numerical problems in the application- the nearest point to question 2 by governance problems in the applicati
fenzhifa
- 这是分治法的小程序,来自书本上的作业. 没什么大的改变.看看就好-This is a small sub-rule law procedures, from the books work. No big change. Look like
petroline
- 输油管道问题 计算机算法设计分析 分治法算法实现题-Computer Algorithm Design and Analysis of pipeline issues divide and conquer algorithm question
zuijindui
- 用蛮力法和分治法解最近对问题以及对算法时间性能及运行结果的分析 -And sub-rule by brute force method of solving the problem, as well as the recent performance of the algorithm and running time analysis of the results
aifenchazhao
- 利用分治法解决二分查找问题，这个程序可以输出结果。希望对大家有一定的帮助，谢谢了-The use of sub-rule method to deal with two minutes to find the problem, this program can output. We want to have some help, thank you
jingdiansuanfa
- 经典算法+分支限界法+分治法+动态规划+贪心算法+回溯法-Classical branch and bound algorithm+ France+ divide and conquer dynamic programming+++ backtracking greedy algorithm
ChessBoard
- 算法分析与设计中用分治法解决棋盘覆盖问题。-Algorithm Analysis and Design using divide and conquer to solve the problem the board cover.
qq
- 分治法网球循环赛日程安排，课程设计希望有用-Divide and conquer tennis round robin scheduling, curriculum design, hope helpful
maxamin
- 如何用分治法求一个数组中的最大值和最小值-With the Method find an array of maximum and minimum values
分治法
- 分治法的详细说明，比较简单易懂，哈哈哈哈(A detailed descr iption of the divide and conquer method)
Divide and conquer methed
- 利用分治法来解决找出n枚硬币中所含有的一枚假币问题(To solve the counterfeit coin problem in n coins by means of divide and conquer method)
分治法求最大子数组以及其对应的下标
- 分治法应用分治法求最大子数组以及其对应的下标分治法求最大子数组以及其对应的下标(Application of divide and conquer therapy)
01beibao_fenzhijiexian
- 分治法实现01背包问题，输入为即将放入背包的物品的重量和对应价值的数组，输出为放置物品的最优方案(Realization of 01 knapsack problem by divide and conquer method)