搜索资源列表
eight-queens
- 分治法求解八皇后问题，一个简单的分治法应用算法。-Divide and conquer method to solve the eight queens problem, a simple application of divide and conquer algorithm.
test1_1
- 设有8个运动员要进行比赛，设计一个日程表： 1)每个选手必须与其他7个选手各赛一次； 2)每个选手一天只能赛一次； 要求：根据分治法基本思想-Of eight athletes to compete to design a schedule: 1) Each player must match the other seven players each time 2) Each player race day only once requirements: According to
NearestPoint
- 算法分析与设计经典问题，用分治法求最近点对，并与蛮力法做对比-Classical algorithm analysis and design problems with the divide and conquer method for the last point, and compared with the brute force method to do
SingleLinkSort
- 使用Visual C++，其实是用了STL了，实现单链表的排序，通过采用分治法，使得时间为O(n*log(n))，空间复杂度O(n)。-Sort of Single Link List
fenzhi
- 分治法源码，01背包问题，经典的01背包问题-Divide and conquer source, 01 knapsack problem
merge
- 用分治法进行归并分类，归并算法的分治思想使用辅助数组归并两个已分类的集合-failed to translate
chess_cover
- 分治法解决棋盘覆盖问题。使用C#，可自定义棋盘大小。每个棋盘用若干L型块覆盖-Divide and conquer method to solve the coverage problem board. Using C#, customizable board size. Each board covered with a number of L-block
Strass
- Strassen矩阵乘法 分治法 矩阵乘法 时间复杂度O(n^2.81)-Strassen matrix multiplication, divide and conquer matrix multiplication time complexity O (n ^ 2.81)
ChessBoard
- 用分治法，一个棋盘，提供一个特殊方格用黑色填充，其余用L型方块填满。-Using divide and conquer, a board, a special box filled with black, the other filled with the L-type box.
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
suanfa2
- 分支限界法、分治法、动态规划法常见代码，素数环问题、背包问题、抄写书稿问题。-Branch and bound method, divide and conquer, dynamic programming method common code, prime ring problem, knapsack problem, the problem copying the manuscr ipt.
fenzhisuanfa
- 分治法的基本思想 ，分治法的适用条件 ，分治法的基本步骤 ，分治法的复杂性分析 ，分治法的几种变形 ，分治法的实例分析
merge
- 分治法排序，给定长度为n的一个序列，对其进行快速排序和求第i小数-(1) Input: A sequence of n numbers <a1, a2, . . .,an>. Output: A permutation (reordering) <a1’, a2’, . . .,an’> of the input sequence such that a1’ a2’ . . . an’ (2) Input:
Board-covering-algorithm
- 棋盘覆盖算法，分治法，使用Microsoft Visual Studio 2010编写，控制台程序-Board covering algorithm, divide and conquer method, using Microsoft Visual Studio 2010 written in console application
Power
- 分别用蛮力法、分治法、减治法求a的n次方，并比较运行时间-Respectively with brute force method, partition method, reduce the power comes for a ^ n,and compare the running time.
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