搜索资源列表
ChessBoard
- 分治法解决棋盘覆盖问题，采用MFC界面实现棋盘覆盖问题的直观描述-Divide and conquer method to solve the coverage problem board, using MFC interface to achieve a visual descr iption of the board covering problem
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
MinDistance_PointPair
- 用java实现的平面上最近点对的查找，包括蛮力法和分治法的实现。-Java implementation of the plane with the nearest point on the search, including the brute force method and the divide and conquer implementation.
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
build-f
- 求解图形轮廓问题，利用分治算法减少时间复杂度。数据结构以链表为主-Graphic outline for solving the problem, using divide and conquer algorithm to reduce the time complexity. Data structures to the main list
Tromino1
- tromino问题，棋盘覆盖，算法中的分治法-tromino problems, board cover, divide and conquer algorithm
sortQuick
- Quicksort sorts by employing a divide and conquer strategy to divide a list into two sub-lists. The steps are: Pick an element, called a pivot, from the list. Reorder the list so that all elements with values less than the pivot come before the
DivideAndConquer
- Divide and conquer android game
guibing
- 这是一个基于分治策略算法的归并排序的程序，使用的语言是C-This is a strategy of divide and conquer algorithm based on merge sort, the use of the language is C++
AccPoint
- Points Allot for conquer 2.0
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
GoldenCoSource
- Cool Source Code Conquer online sdsadsadasdsa
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
30DaysToConquerTOEICReading2010Version
- 30天征服新托业阅读2010版,考托业的好资料，找了挺久才找到的-30 days to conquer the new 2010 version of TOEIC reading
linear
- Recursive divide and conquer algorithm with linear time selection
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