搜索资源列表
Attachments_2012_12_11
- Distinguish the similarity between dynamic programming and divide and conquer design techniques.
fenzhifa2
- 分治法矩阵相乘函数,优化时间复杂度,简单递归调用-Divide and conquer matrix multiplication function
DFT-DaC
- Matlab implementation of the algorithm to compute the Discrete Fourier Transform using the Divide Conquer approach, as described in the book Digital Signal Processing of the autors John G. Proakis and Dimitris K. Manolakis.-Matlab implementation of t
jianzhifa
- 跟据减治法的大整数乘法,此方法是通过对大整数乘法的改进,运行时间更短,跟有效率的算法-According to conquer reduction of large integer multiplication, this method is improved by a large integer multiplication, the running time is shorter, with the efficiency of the algorithm
gaijin-fenzhifa
- 此为对分治法大整数相乘的一个改进,能够给对刚开始学习算法的人一个了解的机会-This is an improved large integer multiplication of divide-and-conquer method to the beginning of the learning algorithm an understanding of the opportunity
Divide-MergeSort
- 分治法描述归并/合并排序,附有文档详细说明。-The divide-and-conquer method described merge/merge sort, with document details.
divid-element-choose
- 算法练习:分治法实现元素选择,附有详细说明、解释。-Algorithms Exercise: Divide and Conquer element selection with detailed instructions, explain.
bianzhifa-cpkdate
- 算法练习:变治法实现cpk的约会问题,附有详细说明+ppt。-The dating algorithm practice of: Variable conquer achieve cpk, with detailed descr iptions+ppt.
Divide-and-ConqueraaMST
- 分治,最小生成树。自己做题的心得以及代码,希望可以对初学者起到一点作用。-Divide and conquer, minimum spanning tree
maze
- 分治算法,走迷宫问题,0可通过,1不可通过。-Divide and conquer algorithms, Maze problem by, not by.
QuickSort
- 用快速排序(分治法),对序列{23,13,49,6,31,19,28}进行升序排列,适用于初学者,算法设计与基础,写的很通俗易懂-Quick sort (divide and conquer), the sequence {23,13,49,6,31,19,28} in ascending order, suitable for beginners, algorithm design and basic, very easy to understand
Shell-Sort
- 谢尔排序可以看作是一种插入排序的扩展方法与插入排序法相同的是,它们都是可以看作是一个个新的元素插入到已排好的数组里面的不同点是,在普通的插入排序法中,它是一个个元素比较,而在Shell s Sort中,相对多了一个步骤,改了一个步骤,其实两个合起来的改动就是多了一个概念,一个分治的概念,从代码实现的角度来看的话,就是多了一个调整步进的变量。-The Rochelle sort can be seen as an extension method of insertion sort and ins
stooge_sort
- 桶排序算法,分治算法,输入一串数字,输出他们从小到大的排序-Bucket sort algorithm, divide-and-conquer algorithm, input a string of numbers, the output from small to large order
Divide-and-conquer
- 分支算法的VC++环境下实现,可以运行,简单适合初学者-Branch algorithm VC++ environment to achieve, you can run simple for beginners
HalfSetAlgorithm
- 利用备忘录策略,采用递归分治方法实现求解半数集问题-Use memo strategies, using recursive divide and conquer method to solve half the problem set
code
- 使用回溯法解决的典型问题的算法:骑士巡游问题,n皇后问题,0-1背包问题。 使用递归与分治策略解决的几个问题的算法:Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
lab1
- 实验一:分治算法归并排序与快速排序平均时间之比较 (验证型实验) 实验目标: (1) 通过实验比较归并排序与快速排序算法在平均情况下哪一个更快。 (2) 加深对时间复杂度概念的理解。-Experiment one: divide and conquer algorithm merge sort and quick sort compare the average time (confirmatory test) test objectives: (1) Comparing a me
trapezoidalmap
- 平面点集的Delaunay三角剖分。为了验证Delaunay三角剖分的正确性,系统提供了“圆测试”的功能,供用户对生成的三角形进行测试验证;为了验证DCEL数据结构的正确性,系统提供了“DCEL测试”的功能,用户输入任意一条测试线,系统将先后显示出测试线贯穿过的三角形;为了形象显示三角剖分的分治过程,系统提供了动态显示分治剖分过程。 -Planar point set Delaunay triangulation. In order to verify the correctness of De
matlabxuexi
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法:模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法)-This is a good model to study the information, download it quick
bigNumMult
- 计算1万位以上的大整数乘法,有蛮力法和分治法-Calculation 10,000 more than the large integer multiplication with brute force method and the divide and conquer