搜索资源列表
binarytree
- 二叉树的递归(先序,中序,后序)遍历,创建叶子结点数,二叉树深度-Recursive binary tree (first order, in sequence, after the order) traversal, create leaf nodes, tree depth
digui
- 递归的小程序,希望对大家有所帮助-Recursive small program, I hope all of you to help
house
- 马踏棋盘问题描述设计一个国际象棋的马踏遍棋盘的演示程序。2. 基本要求将马随机放在国际象棋8*8棋盘的某个方格中,马按走棋规则进行移动。编制非递归程序,求出马的行走路线,-Horse riding problem described in the design of a chessboard chess chessboard horse traveled demo program. 2. The basic requirements will be placed randomly MA 8* 8
linear
- - 1、限幅滤波法(又称程序判断滤波法) 2、中位值滤波法 3、算术平均滤波法 4、递推平均滤波法(又称滑动平均滤波法) 5、中位值平均滤波法(又称防脉冲干扰平均滤波法) 6、限幅平均滤波法 7、一阶滞后滤波法 8、加权递推平均滤波法 9、消抖滤波法 10、限幅消抖滤波法 -- 1, limiting filtering method (also known as filtering method to determine the procedure) 2, the median filteri
RotateAndTranslateASierpinski(3Dimension)
- 该程序是一个三维的Sierpinski镂垫程序,是在VC++MFC环境下利用OpenGL编写的,并且可以通过鼠标和键盘旋转和移动该三维镂垫,采用递归方法,使用四个初始顶点定义一个四面体,可以随即选取四点作为四面体的四个顶点,条件是4点中任意3点不共线。而在该程序中必须进行隐藏面消除,同时该程序对初学分形理论者可以给予很好的启示。-The program is a three-dimensional Sierpinski gasket procedure is VC++ MFC environme
kalman
- 1960年,卡尔曼发表了他著名的用递归方法解决离散数据线性滤波 问题的论文。从那以后,得益于数字计算技术的进步,卡尔曼滤波器 已成为推广研究和应用的主题,尤其是在自主或协助导航领域。-In 1960, Kalman published his famous recursive solution using discrete data linear filtering problem papers. Since then, figures to benefit from advances
MyHanoi
- 汉诺塔简单实现。用命令行实现,递归调用。-Hanoi Tower simple to achieve. Command line with the realization of recursive calls.
DosAvl
- 这是一个数据结构的小程序,非递归的avl树实现,用到了穿线法-This is a data structure of small procedures, non-recursive AVL tree realization, using the threading method
C1
- 将一个磁盘文件的信息复制到另一个磁盘文件中.编写一个输出链表的print.用选择法对10个整数按从大到小排列.汉诺塔算法的递归实现C源代码.(输出数组中的全部元素-A disk file copy to another disk file. To prepare a list of the output print. With selection of 10 by the smallest integer array. Recursive Tower of Hanoi algorithm rea
pre
- 以先序之方法遍历二叉树,以递归方法和非递归方法分别实现。-To preorder tree traversal methods to recursive methods and the realization of non-recursive method, respectively.
parser0.03
- 语法分析程序,使用是递归子程序法.自己写的程序,学习-Syntax analysis, the use of law is a recursive subroutine. Own written procedures, learning
yufa
- 编译原理语法分析程序,使用递归子程序法。被分析语言类似与Pascal语言,使用VC6.0编写。-Compilation Principle parsing procedures, the use of recursive subroutine law. Analysis of the language was similar with the Pascal language, using VC6.0 prepared.
hannuota
- 算法思路: 1.如果只有一个金片,则把该金片从源移动到目标棒,结束。 2.如果有n个金片,则把前n-1个金片移动到辅助的棒,然后把自己移动到目标棒,最后再把前n-1个移动到目标棒. 3.单纯对于有N个金片要挪动的步数求出, 可以使用递推方法,满足递推方程f(i) = f(i - 1) * 2 + 1-Algorithm idea: 1. If there is only a gold film, while the gold from the source to the
binary_tree
- 二叉树三种遍历的非递归算法 给出二叉树先序、中序、后序三种遍历的非递归算法,此三个算法可视为标准算法,直接用于考研答题。-Binary Tree Traversal three non-recursive algorithm
RecursiveuseCTreeCtrlClass
- CTreeCtrl类的递归使用 ,可以搜任意层目录-Recursive use CTreeCtrl class, you can search the directory layer of arbitrary
ra
- 这是RA(recursive algorism)的一个实现程序。-This is an implementaion of RA algorism.
zuixiaoerchengfa
- 这个程序主要是一个递推的最小二乘发,根据diphon方程来辨识一类系统的参数-This procedure is essentially a recursive least squares fat, according to diphon equation to identify a class of system parameters
erfenfadigui
- 用递归实现的二分法,数据结构的典型问题,二分查找也称折半查找,它要求待查找的数据元素必须是按关键字大小有序排列的顺序表。-Realize the dichotomy with recursive data structure of a typical problem, binary search, also known as split-half search, which requires the data elements to be search by keyword must be or
1
- 使用APriori算法,通过递推方法,求得频繁目标集,可以实现数据处理的优化功能-Use Apriori algorithm, through the recursive method to obtain the frequent target set, you can realize the optimization of data-processing functions
binarysearch
- 问题的提出:编写程序对数据序列采用二分查找法和顺序查找法查找元素的下标,要求使用类模板实现(其中二分法查找算法要求用递归实现,给定数据序列有序)。-Of the problem: the preparation of procedures for the data sequence using binary search method and the order of search law search element subscr ipt, require the use of class t