搜索资源列表
qiege
- 解决了矩形板切割矩形材料的问题,采用递归分治的方法-solve the rectangular plate rectangular cutting materials, using recursive method of administration
power
- 该程序用于计算幂积,它比普通的连乘方法要快得多,主要是它含有分治的思想。-the procedures used in the calculation of power plot, it more than ordinary continually multiply much faster method, it is the partition containing the idea.
dividemultiply
- 这是一个分治法应用的又一个例子,利用分治技术,做大整数乘法,尤其是几百位数以上的乘法,比一般的方法快很多,仅次于快速傅立叶变换.-This is a partition of the application also an example of the use of the partition, bigger integer multiplication, especially above the median of hundreds of multiplication, than the mu
BigIntMultiplication
- 使用分治技术,实现的两个大整数的乘法运算-The use of sub-rule technology, the realization of two big integer multiplication
xx
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法:分治方法1(该方法在递归时由于使用数组的值,使得 递归进栈的数据很多,消耗系统空间很大,所以最多 处理的个数经测试不超过70个,可见在设计程序时,考虑 空间的使用也是很必要的!)-The realization of the program of one-dimensional data point near the axis of the most used method of solving the pro
iclass
- 此程序是用分治算法思想将两个规模为2^k*2^k的矩阵相乘-This procedure is divided algorithm thinking the two size 2 ^ k* 2 ^ k matrix multiply
city
- 城市轮廓线算法。采用分治发算法,输入为第一行房子个数,而后(左,高,右)。-Contour algorithm city. Made use of sub-rule algorithm, enter the number for the first line of the house, and then (left, high, right).
CLOSESTPAIR
- 使用分治算法找到平面上的n各点的集合S中最小距离的一个点对-Use Divide and Conquer Algorithm to find the plane of the set of n points S in the minimum distance of a point on the
test
- 设计出的两个任意维数矩阵相乘的三种优化算法,包括矩阵分治和strassen算法-Design of the two matrices of arbitrary dimension of the three optimization algorithms, including matrix algorithm for partition and strassen
Hamilton
- 8*8 的国际象棋棋盘上的一只马,恰好走过除起点外的其它 63 个位置各一次,最后回 到起点。这条路线称为一条马的 Hamilton 周游路线。对于给定的 m*n 的国际象棋棋盘,m 和n均为大于5的偶数,且|m-n|≤2,试设计一个分治算法找出一条马的Hamilton周游路线。 编程任务: 对于给定的偶数m,n≥6,且|m-n|≤2,编程计算 m*n 的国际象棋棋盘一条马的Hamilton 周游路线。 Input 输入数据的第一行有2
cc
- 一个最快求中位数的算法,根据快速排序和分治的思想。-Seeking a fastest median algorithm, according to quick sort and the idea of partition.
bignumber
- 分治法实现的大整数乘法。是学习分治算法策略的很好的范例。-Sub-rule method to achieve the large-integer multiplication. Is a good example of learning the strategy of divide and conquer algorithm.
top-ten-algorithms-of-mathematical
- 自己在各个论坛上搜集的十大算法,Dijkstra算法,Floyd算法,动态规划,分治算法,概率算法,灰色预测,聚类算法,蒙特卡洛,模拟退火算法,神经网络等等,附有算法的原理,部分含有相关的程序源代码。-In various forums to collect the ten algorithms, Dijkstra algorithm, the Floyd algorithm, dynamic programming, divide and conquer algorithms, probabi
max
- 实验描述:给定X和Y都是n位整数,计算乘积XY。分治算法思想,将n位X和Y分成2段,每段n/2位。则X分为AB两段,Y分为CD两段。 有X=A*(10)^(n/2)+B,Y=C*(10)^(n/2)+D;XY=(A*(10)^(n/2)+B)(C*(10)^(n/2)+D)=AC*(10)^n+(AD+BC)*(10)^(n/2)+BD。 -Experiment: given X and Y are n-bit integers, calculate the product of the
HalfSetAlgorithm
- 利用备忘录策略,采用递归分治方法实现求解半数集问题-Use memo strategies, using recursive divide and conquer method to solve half the problem set
divide-and-conquer-algorithm
- 利用分治策略求解时,所需时间取决于分解后子问题的个数、子问题的规模大小等因素,而二分法,由于其划分的简单和均匀的特点,是经常采用的一种有效的方法,例如二分法检索。-When solving using the divide and conquer strategy, the time required depends on the number of decomposed sub-problems, the size of sub-problems and other factors, but
roud-robin-scheduling
- 经典的网球循环赛日程算法设计 利用了分治算法-round robin scheduling design
divide-and-conquer
- 组合优化与算法分析 分治算法(divide and conquer)的描述和分析-divide and conquer
合并排序的分治算法
- 在Visual C++里编写程序,用分治法完成随机输入数列的合并排序(The program is written in Visual C++, and the sorting and sorting of random input sequence are completed by divide and conquer method)