搜索资源列表
hannoi
- 汉诺塔问题c语言实现 递归方法-Tower of Hanoi Tower of Hanoi problem c language c language recursion problem
totalarrange-recursion-backtracking
- 在排列树上递归回溯搜索全排列问题的全部解-Recursive backtracking search tree in the arrangement of the whole array of all solutions of the problem
ClosetPairs
- 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序,使得所有的点是按x坐标从小到大排好序的(x坐标相同时y坐标小的排前),然后取下标小于n/2属于左边的点集PL,取下标大于n/2属于右边的点集PR,即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法,分别求出PL和PR中的最近点对,最终通过递归实现。-This algorithm uses divide and conquer to solve the probl
Findfile
- Findfile 利用递归算法查找文件的例子,d5及以上支持-Findfile use recursion algorithm search document example, d5 and above supports
Cchengxu
- 这个程序包包括了C语言中的一些常见的程序,如阶乘,读取二进制文件,递归,二维数组平均值排序等几十个程序。有了这些程序,会更好的进行科学计算-This package includes the C language of some common procedures, such as factorial, read binary files, recursion, sorting, such as the average of two-dimensional array of dozens of
Projects
- 一些关于算法的小程序,里面有关递归调用的运用,希望有用!-some programs about algorithms,especially for recursion.hope to help you!
gcd
- to get GCD(A,B),and no recursion -to get GCD(A,B),and no recursion
acm..
- 自相关法求全极点模型参数; 下行递归; 逆Levinson-Durbin递归(模型参数~自相关序列); 平均周期图的Bartlett方法; Blackman-Tukey功率谱估计。-Autocorrelation perfection pole model parameters downward recursion inverse Levinson-Durbin recursion (model parameters ~ autocorrelation sequence)
levinson
- levinson-durbin recursion
CommonAlgorithmDesign
- 常用的算法设计方法集合,主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
Fractal
- 分形算法设计,包括摇曳的分形递归树、摇摆的Sierpinski三角形、万花筒和王冠(Julia集)-Fractal algorithm design, including the fractal recursion trees swaying, rocking the Sierpinski triangle, Kaleidoscope and the crown (Julia set)
nqueens-recursion-backtracking-n^n
- n皇后问题的递归回溯实现, 状态数:n^n-n queens problem of recursive backtracking implementation, the number of states: n ^ n
fenzhifa
- 分治法的思想是将一个难以直接解决的大问题分割成一些规模较小的几个相似的问题来解决,分治法的求解过程是将整个问题分解成若干个小问题后分而治之,如果分解得到的子问题相对来说还太大,则可反复使用分治策略将这些子问题分成更小的同类型子问题,直至产生出方便求解的子问题,必要时逐步合并这些子问题的解,从而得到问题的解。分治法的求解通常会用到递归,通常会说分治法是一种找大规模问题与小规模问题关系的方法,是递归设计方法的一种具体策略。分治法的基本步骤在每一层递归上都有三个步骤: ① 分解:将原来的规模相对较
Test-deep
- 用于测试在系统下可以使用VB进行最多多少层的递归。-Used for testing the system can use VB for the most number of layers recursion.
fortran
- 指针与递归 指针与递归 指针与递归 PPT -Pointers and recursionPointers and recursionPointers and recursionPointers and recursion PPT
Round-robin-schedule
- 循环赛日程表。大学算法分析与设计的实验课题目。有递归和非递归两种方法,这里上传递归,仅供参考!-Round-robin schedule. Head of the University of algorithm analysis and design of experimental subjects. There are two methods of recursive and non recursive upload recursion, for reference purposes only
erchashubianli
- 二叉树中序遍历递归算法演示,用图形描绘了是怎么用递归算法遍历二叉树,很形象直观。-Binary tree Recursion algorithm
non-recursion-of-binary-tree
- 非递归建立二叉树,可以直接运行。采用堆栈的方法建立二叉树,而不是递归,展示了堆栈的先进后出的特性。数据结构的内容-Establishment of non-recursive binary tree can be run directly. Method to create a binary tree using the stack instead of recursion, showing advanced after stack features
Recursion
- 包含三个文件,文件中用示例讲解用递归解决问题,便于理解递归-Contains three files, using file example to explain the problem with recursion, easy to understand recursion
DecToBinary_Recursive
- Visual Basic 递归 十进制转化为二进制(Recursion Convert Denary To Binary)