搜索资源列表
feangzhi
- 本文介绍了分治法的基本思想和基本步骤，通过实例讨论了利用分治策略设计算法的途径。 目录 简介 分治法的基本思想 分治法的适用条件 分治法的基本步骤 分治法的复杂性分析 分治法的几种变形 分治法的实例分析 -This article describes the basic idea of sub-rule method and the basic steps, through an example de
1
- 考虑8 x 8的国际象棋棋盘上某个位置的一匹马，它是否可能只走63步，正好走过除起点以外的其他63个位置各一次？如果有这样的一种走法，则称所走的这条路线为一匹马思维周游路线。试设计一个分治算法找出一条马的周游路线。-Consider 8 x 8 chess board on a horse to a location, it may only take 63 steps, just walk away than from the other 63 positions each time? If
xunhuansaiqxf
- 算法课程设计 分治法解决循环赛日程表 源代码+word报告+答辩PPT-Curriculum design of divide and conquer algorithm to solve a round robin schedule report+ source code+ word reply PPT
Algorithm_Analysis_and_Design_of_recursive_and_div
- 算法分析设计之递归与分治法Algorithm Analysis and Design of recursive and divide and conquer-Algorithm Analysis and Design of recursive and divide and conquer Algorithm Analysis and Design of recursive and divide and conquer
fenzhifa
- 用c++实现分治法算法的最近点对问题（在VS2008平台上）-Using c++ implementation of divide and conquer algorithm for the nearest point of the problem (in VS2008 platform)
fenzhi
- 算法，用c++实现分治法算法的众数问题（在VS2008平台上）-Algorithm, using c++ implementation of divide and conquer algorithm mode problem (in VS2008 platform)
Strassen
- 矩阵乘法分治法实现。。C-Divide and conquer matrix multiplication implementation. . C++. . . . .
Select
- 第k小元素，分治法实现。。C-K-small elements, divide and conquer implementation. . C++. . . . .
a
- 分治策略—归并排序。（1）编写一个模板函数： template <typename T> MergeSort(T *a, int n) -Divide and conquer strategy- merge sort. (1) Write a template function: template <typename T> MergeSort (T* a, int n)
somealgorithm
- 描述了分支定界算法，贪婪算法，动态规划算法，分而治之算法，回溯算法，理论性很强-Describe the branch and bound algorithm, greedy algorithms, dynamic programming algorithm, divide and conquer algorithms, backtracking algorithms, highly theoretical
fenzhisuanfa
- 分治算法的介绍 C++ ACM-Divide and Conquer Algorithm descr iption
quiksort
- 一个简单的快速排序程序，它是基于分治策略实现的。-A simple quick sort program, which is based on divide and conquer strategy to achieve.
fenzhisuanfa
- 这是中国数学建模中编程交流上分治算法内容，里面提供了很多分治算法的例子-This is the exchange of mathematical modeling in the programming content on the divide and conquer algorithm, which provides many examples of divide and conquer algorithm
Tromino1
- tromino问题，棋盘覆盖，算法中的分治法-tromino problems, board cover, divide and conquer algorithm
guibing
- 这是一个基于分治策略算法的归并排序的程序，使用的语言是C-This is a strategy of divide and conquer algorithm based on merge sort, the use of the language is C++
juzhen
- 这是用四种方法写的矩阵相称问题，有传统的，有两种优化的，还有一种是分治法-This is a matrix with four ways to write the issue of proportionality, there are traditional, there are two kinds of optimization, there is a divide and conquer
closepair
- 二位平面中求最近点对的问题，采用分治的方法，按照书本的算法实现-Two nearest points on the plane ask the question, the use of divide and conquer approach, in accordance with the books of the algorithm
Ten_Commonly_Algorithm_for_MATLAB
- 超过10种MATLAB常用算法：Floyd算法，动态规划,分治算法,概率算法,模拟退火算法,神经网络,搜索算法,贪婪算法,遗传算法,组合算法,-Over 10 types of commonly used MATLAB algorithms: Floyd algorithm, dynamic programming, divide and conquer algorithms, probabilistic algorithms, simulated annealing, neural netwo
guibingpaixu
- 基于分治思想的归并排序算法简单实现,使用C++编写.-Based on Divide and Conquer simple implementation of merge sorting algorithm, written using C++.
Algorithmdesign
- 递归与分治算法的设计 动态规划算法设计 贪心算法设计 -Recursive divide and conquer algorithm with dynamic programming algorithm designed greedy algorithm