搜索资源列表
FindPath_kinpoo
- 连连看 寻路算法 递归实现 /** * Author:郭剑波(KINPOO) * Last Modify:2005/11/21 13:40 * Purpose:find path for lian lian kan */-find their own path to achieve recursive algorithm / ** * Author : Jian (KINPOO) * Last Modify : 10/14/2005 13:40 * Purpose : fin
serach
- 二叉排序树的查找算法，用非递归做的，查找删除节点等操作-Binary Tree Search ranking algorithm, the use of non - recursive so that you delete nodes, etc
dgsxzs
- 这个是用c语言编写的一个用递归实现的小程序，程序的功能是实现你输入两个整数m，n（m>n），他输出一连串的数组，其中每个数组都是从这m个数中选择的不同的n个数。找出所有这样的数组。-c is the language used in a recursive procedure to achieve a small, procedural functions of achieving your input two integers m, n (MGT; N), a series of out
Strassen_8
- Strassn关于两个矩阵相乘的算法，同过分治原理把两个n*n的矩阵阶各分解成四个n/2*n/2阶的矩阵，当分解出来的矩阵阶数等于2时，求借各个小矩阵，若阶数大与2，就递归的调用前面方法，直到分解成2*2的子矩阵为止。-Strassn on two matrix multiplication, the algorithm, with the governing principle over two n * n matrix of the band decomposed into 4 n / 2
fengchuifenxing
- 风吹分形树：本例采用WIN32 + 字符替换法 模拟从2阶到N阶 经典分形树的实现。而经典的算法采用递归实现。 其中的字符替换法 可作为此类问题的通解-wind fractal tree : the characters WIN32 cases using replacement simulation from two bands of N-classic fractal tree realized. The classic recursive algorithm to achieve. T
fenxingshu
- 这是一个分形图形实现程序，可以实现C曲线，KOCH曲线，分形树（包含递归实现）。-This is a fractal graphics procedures, can be achieved C curve, KOCH curve, fractal tree (includes recursive).
weizeke
- 维则克方块：黑白递归调用。这是小弟学分形学是做的VC++ WIN32+GDI 编程；-peacekeeping grams squares were : black and white recursive call. This is the brother-credit study is done VC WIN32 GDI programming;
serchfile
- 递归扫描目录 用delphi写的 希望大家喜欢-recursive directory scan with delphi wrote hope you like
programing
- 三十六进制转换,没有进行递归算法,自己想的就写了.还有条码机的指令(ZEBRA)-36 base for the conversion, no recursive algorithm, we think it was made. There barcode machine directive (ZEBRA)
erchashu3
- 二叉树的便先中后三中递归和非递归方式的实现-binary tree after they were first three recursive and non - recursive approach to achieve
wodechengxu
- 本程序实现的是一个对于一个给定的数字集合,再给一个数字限制,求得这个集合的所有子集合,使子集合的各个元素之和为给定的数字限制,如果没有这样的子集合,则输入为空! 程序本身运用的是回朔算法,但是值得注意的是,我用的是非递归的形式实现的,所以就显现出了一定的难度. -this program is one for a given set of figures, to give a figure restrictions this assembly obtained all the
AlgorithmCode
- 海明码 出站入站序列 非递归生成树 九格填质数 七子控棋盘等等算法-Haiming yards out station stops recursive sequence-9 grid spanning tree fill several seven-quality control algorithm chessboard, etc.
meshpartdist.tar
- This toolbox contains Matlab code for several graph and mesh partitioning methods, including geometric, spectral, geometric spectral, and coordinate bisection. It also has routines to generate recursive multiway partitions, vertex separators, and nes
Subd
- 用递归算法实现的球体的程序，我曲面建模的作业！希望对大家能有帮助-using recursive algorithm of the ball, and I surface modeling operations! We can hope for help
wangxinwen
- 树的建立,各种遍历(先根递归,先根非递归,中根递归,中根非递归,后根递归,后根非递归,层次遍历,最近公共祖先的查找,树的删除-tree establishment of various traverse (first - recursive and non - recursive first root, root recursive and non - recursive root, root recursive, non - recursive root level, traverse, th
2060
- 判断另一种斐波那契系列是否是3 的倍数问题 该题如果用递归求出F(n),然后判 断将会超时。 注意到F(n) = F(n-1) + F(n-2)根据和的模等于模的和。 即有F(n)％3=(F(n-1)％3+F(n-2)％3)％3 F(0)％3=1,F(1)％3=2 计算F(n)％3 : 1,2,0,2,2,1,0,1,1,2,0,2,2,1…………… 可以看出F(n)％3 以1,2,0,2,2,1,0,1, 重复出现 F(n)％3=0 即F(n)是3 的倍数此时的n
shangji1.2
- 这个程序是根拒目前流行的汗诺塔问题编写成的，用的是递归方法，程序简单，易懂-root of this procedure is to resist the prevailing problem of Khan Notari compiled, using the recursive methods, and procedures simple, understandable
汉诺塔的演示程序
- 初学MFC时的拙作，一个汉诺塔的演示程序，采用非递归、非堆栈的算法，直接根据当前步数推算出汉诺塔的状态。界面用GDI实现，伪3D的风格。-beginners at the exposition, a HANOR the demo program, the use of non - recursive and non-stack algorithm, directly under the current steps are projected HANOR state. GDI interface
feidiguibahuanghou
- 非递归八皇后问题。以前大家常见的是递归的，现在传个非递归的-Queen's eight non - recursive problem. Before we often are recursive, and now-non - recursive
diguihuayuan
- 应用递归的方法绘制图形,每个中心圆有8个卫星圆,用Sleep()函数来实验动画效果-application recursive method drawing, each center has won eight satellite yen, with Sleep () function to experimental animation