搜索资源列表
MaxOfSubSegSum
- vc求最大子串和问题 分别采用分治法和蛮力法很好的解决了这个问题-vc find the largest substring and problems, and were used to divide and conquer a good brute force method to solve this problem
devide
- 分治法实验报告 非常实用，有详细的代码，是一个WORLD里面的-Divide and conquer divide and conquer method lab report experiment report divide and conquer divide and conquer method experiment lab report report
dazhengshuxiangcheng
- 利用分治法实现大整数相乘，大整数可以是很长的位数-Using divide and conquer method to achieve large integers, big integers, the number of bits can be very long
Recursion-and-divided-.ppt
- 这是关于分治与递归算法的课件，文章详细的讲解了这两周算法的设计要点。-This is about divide and conquer and recursive algorithm courseware, the article explained in detail the design elements of the algorithm for two weeks.
fenzhifa
- 分治算法的一些源码，可以供大家学习一下，介绍分支算法的逻辑 -Divide and conquer algorithm for some of the source, you can look for them to learn
suanfa2
- 分支限界法、分治法、动态规划法常见代码，素数环问题、背包问题、抄写书稿问题。-Branch and bound method, divide and conquer, dynamic programming method common code, prime ring problem, knapsack problem, the problem copying the manuscr ipt.
6
- First, the longest common subsequence problem two largest sub-segment and problems (divide and conquer algorithm) Third, the largest sub-segment and the problem (dynamic programming algorithm)-First, the longest common subsequence problem two larges
Board-covering-algorithm
- 棋盘覆盖算法，分治法，使用Microsoft Visual Studio 2010编写，控制台程序-Board covering algorithm, divide and conquer method, using Microsoft Visual Studio 2010 written in console application
MaxSum
- 用蛮力法、分治法和减治法求最大子段和问题并比较运行时间。-With the brute force method, divide and conquer method for the treatment and reduce the largest sub-segment and the issues and compare the running time.
ClosestPoints
- 分治法和蛮力法求最近对问题及其时间复杂度比较-Divide and conquer method and the brute force method for the recent problems,and comparing the running time.
qipanfugai_CPP
- 用C++编写的棋盘覆盖问题的解决，其中有非常清楚的注释，帮助学习者了解分治法在类似问题中的应用-Board cover solution written in C++, which has a very clear comments to help students understand the divide and conquer those problems
qipanfugai_matlab
- 用matlab编写的棋盘覆盖问题的解决，有清楚的注释，帮助学习者了解分治法在类似问题中的应用-Matlab prepared by the board covering problems, clear notes, to help students understand the divide and conquer similar problems
fzfksfl
- 分治法快速排序的c++代码，实现平台为visual studio 2008-Divide and conquer quicksort c++ code, the platform for Visual Studio 2008
NearestPoint
- 使用分治法实现最近点对算法，图形化界面，可以通过鼠标点击生成点也可以随机生成，并计算得到最近点对-Divide and conquer method to achieve the closest point algorithm, graphical interface, can be generated by a mouse click can also be randomly generated, and calculated to the nearest point on
algorithms
- 附件是邓建明老师上的算法课的详细课件，设计算法设计与分析的各个方面，如分治法，贪心算法，平摊分析等，希望对大家有帮助-Attachment algorithm Jian-ming teacher lesson courseware, and all aspects of the design algorithm design and analysis, such as divide and conquer method, greedy algorithms, amortized analysis
1
- 分治法最优三角剖分 三角剖分与Delaunay剖分的定义 Delaunay三角剖分的定义 -divide and conquer delaunay triangulation
FillBoard
- MFC实现的填充棋盘小程序，鼠标单击窗口任一点，即时生成填充棋盘的解法。填充算法使用分治法。-Fill the chessboard small program is implemented by MFC, mouse click the window at any point, the solution immediately generated to fill the board. Filling algorithm using the divide and conquer.
dbbz
- 自己实现的敌兵布阵的源代码，HDOJ1066题，数据结构使用了线段树和树状数组，算法策略使用了分治策略。-Own implementation of the enemy soldiers ended their source code, HDOJ1066 question, data structures using the segment tree and the tree array, the algorithm strategy of divide and conquer strategy
bignumber
- 分治法实现的大整数乘法。是学习分治算法策略的很好的范例。-Sub-rule method to achieve the large-integer multiplication. Is a good example of learning the strategy of divide and conquer algorithm.
pai-xu
- 顺序表的结构没有给出，作为演示分治法这里从简顺序表取一整形数组数组大小由用户定义，数据随机生成。我们知道如果数组大小为 1 则可以直接给出结果，如果大小为 2则一次比较即可得出结果，于是我们找到求解该问题的子问题即: 数组大小 <= 2。到此我们就可以进行分治运算了，只要求解的问题数组长度比 2 大就继续分治，否则求解子问题的解并更新全局解以下是代码-e order of the table structure did not give a simple order form as a p