搜索资源列表
hanno
- /汉诺塔递归算法过程解析: //汉诺塔(又称河内塔)问题是印度的一个古老的传说。开天辟地的神勃拉玛在一个庙里留下了三根金刚石 //的棒,第一根上面套着64个圆的金片,最大的一个在底下,其余一个比一个小,依次叠上去,庙里的众僧 //不倦地把它们一个个地从这根棒搬到另一根棒上,规定可利用中间的一根棒作为帮助,但每次只能搬一个, //而且大的不能放在小的上面。解答结果请自己运行计算,程序见尾部。面对庞大的数字(移动圆片的次数) //18446744073709551615,看
DFSfunction
- DFS非递归函数 函数功能:图的dfs的非递归算法(用堆栈实现) 输入:图的邻接矩阵 输出:dfs序列 -DFS non-recursive function function function: dfs map non-recursive algorithm (using the stack to achieve) Input: adjacency matrix graph output: dfs sequence
123
- 数据结构课程中,采用非递归算法 ,利用栈中序遍历二叉树。-Data structure course, the use of non-recursive algorithm using binary tree traversal stack.
Graphics
- 一个集成的图形界面的程序,可调用每一次作业子程序。 一、调用画点的函数,用DDA、中点算法画直线和中点算法画圆和椭圆。 二、多边形扫描转换算法和区域填充算法实现(扫描线算法为必做,基于求余运算的边缘填充和边标志算法为任选;基于种子的区域填充采用4连通区域的递归种子填充算法,或扫描线种子填充算法,要求种子点(x,y)可交互输入)。 三、线段裁剪和多边形裁剪算法的动画演示实现。(两种线段裁剪算法和H-S多边形逐边裁剪算法)多边形裁剪算法的动画演示要求先画出一个封闭的多边形,再画矩形的裁剪
feibonaqieshulie
- 用递归算法设计实现的斐波那锲数列,有些地方可能不太完善-Design and Implementation of recursive algorithm using the Fibonacci series Qie, some places may not be perfect
Tower
- 用递归算法在vc中实现多层hanoi塔,程序实现动画显示-Recursive algorithm used in vc achieve multi-storey tower hanoi, procedures to achieve animation show
calculate
- 表达式求值的栈算法和递归算法,经过各种测试,应该没什么问题-Expression for the value of the stack algorithm and recursive algorithm, after various tests, it should be no problem
SeedFill
- 计算机图形学作业。种子填充算法。非递归和递归两种。效率不错。-Computer graphics operation. Seed fill algorithm. Two non-recursive and recursive. Good efficiency.
RLS
- 递归最小二乘滤波器算法,包含对于单频正弦信号和实际语音信号的处理结果-Recursive least squares filter algorithm, that contains the single-frequency sinusoidal signal and the actual voice signal processing results
digui
- 《数据结构课程设计案例精编》上第7章的递归算法,包括Hanoi、maze、八皇后-err
suanfa
- 数据结构三种先序遍历非递归算法。 数据结构三种先序遍历非递归算法。-Data structure of three first traversal non-recursive algorithm. Data structure of three first traversal non-recursive algorithm.
paixu
- 快速排序的递归算法实现 效率要比选择法排序、冒泡法排序要高-Quick Sort efficient recursive algorithm than selection sort, bubble sort method higher
SeedFill
- 种子填充算法的详细实现,使用了递归算法,通俗易懂。-Seed fill algorithm to achieve a detailed, the use of a recursive algorithm, user-friendly.
2_Feibonaci
- 用VC6.0编写的Feibonaci数列_数组叠加算法。可以手动输入阶数,采用了64位长整型计算,精度可到10e18左右。数组叠加算法比较简单,而且计算速度快于递归算法。-Feibonaci prepared using VC6.0 series _ array superposition algorithm. Can manually enter the order using the 64-bit long integer, the precision can be about 10e18.
Bitree
- 二叉树三种遍历的非递归算法(背诵版) 本贴给出二叉树先序、中序、后序三种遍历的非递归算法,此三个算法可视为标准算法,直接用于考研答题。 -Binary Tree Traversal three non-recursive algorithm (recitation version) gives the paste bintree first order, in sequence, after the sequence of three non-recursive traversal al
Bittree
- 二叉树所有简单的功能,包括遍历的递归和非递归算法,值得学习研究哦!-Binary tree of all the simple features, including traversal of recursive and non-recursive algorithm, it is worth study, oh!
DFS
- DFS算法的非递归函数 老师布置的,满分作业哦!-DFS algorithm of non-recursive function teacher layout, operating out of Oh!
Hanoi
- 这是用递归算法实现的汉诺塔程序。实现虽然简单,但它最大的特色就是输出形式比较美观。-This is a recursive algorithm using the Tower of Hanoi program. Although simple to achieve, but it s biggest feature is the output form of comparative aesthetics.
2
- 用邻接表表示的图的深度优先周游的非递归算法,邻接表的构造算法-Adjacency list with the plan said the depth-first tour of the non-recursive algorithm, adjacency list structure algorithm
BPNet
- 递归算法示例计算,供相互学习之用.他可计算:n的1次方到n的k次方的和.-Example calculation of recursive algorithm, for mutual learning. He Computable: n-th power of 1 to n and the k-th power.