搜索资源列表
数据结构的一些简单编程题
- 数据结构的一些简单编程题,二叉树结构,遍历的递归于非递归算法-data structure that some simple programming, binary tree structure, traverse the non - recursive recursive algorithm
T12
- dfs的非递归算法-dfs non - recursive algorithm
递归下降
- 简单的语法分析,递归下降语法分析-simple syntax analysis, recursive grammar analysis drop
实验四
- 1.单链表的顺序查找, 2有序表的折半查找(用递归实现), 3有序表的折半查找(用非递归实现)。-1. Single-Chain order to find, orderly Table 2 BINARY SEARCH (using recursive), Table 3, orderly BINARY SEARCH (non - recursive).
数据结构hh
- 约瑟夫环源代码,前中后序递归遍历二叉树-Josephus source code, before, during and after recursive traversal sequence binary tree
运用递归来解N皇后问题
- 运用递归来解N皇后问题-use recursive solution to the problem of N Queen
二叉树的深度
- 用递归求出二叉树的深度-derived using recursive depth of the binary tree
先序非递归遍历
- 用非递归的方法先序遍历二叉树-non - recursive method preorder Binary Tree
9.层次的非递归算法
- 层次的非递归算法-level of non - recursive algorithm
adapQuad
- 迭代自适应Simpson,Lobatto积分 In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear r
polygone
- 此程序用来画多边形,并用进行区域填充(内点为4连通区域的递归填充算法)-the procedure used to draw polygons, and filled with regional (within four points of connectivity in the region filled recursive algorithm)
jftp-1[1].00pre1.tar
- JFtp是一个用 Java编写的图形化的FTP客户端程序。它支持所有基本的FTP操作,有一些改善的性能,如递归式目录上传,漂亮的swing UI,能够自动断点续传,能识别不完整的目录名。API从GUI中分离,可以用于第三方应用程序或命令行模式。-JFtp Java is used to prepare a graphical FTP client program. It supports all basic FTP operation, the performance of some impro
SQL Server 数据库结构查看程序(VC源码)(2.1)
- CTreeCtrl类的递归使用-CTreeCtrl kind of recursive use
递归
- 递归算法,字符串的倒序输出。-recursive algorithm, the reverse output string.
dfs
- 数据结构里的dfs算法,包括递归与非递归。用vc6.0编写-data structure, the dfs algorithms, including recursive and non - recursive. Prepared with vc6.0
auto_clean
- 自动递归删除文件的工具程序-automatically delete files recursive procedure tools
8_eightqueens
- 8皇后问题的递归求解,c语言实现-8 Queen of recursive solution, c Language
树的问题(生成)
- ADT BinaryTree 的实现及验证程序采用的主要数据结构:二叉树、栈、队算法思想:1、 先序建树、输出树、后序遍历用递归方法。性能分析:O( n )2、 先序遍历、中序遍历:性能分析:O( n )(1) 若遇到新节点非空则先入栈,然后访问其左子树。(2) 若为空则将栈顶结点出栈,访问其右子树。(3) 循环1、2直到栈为空且无节点可入栈。先序与中序的区别是:先序在入栈时访问节点,中序在出栈时访问节点。3、 层遍历:性能分析:O( n )(1) 根节点入队(2) 节点出队并访问(3) 若节点
coutbx
- 用汇编语言实现将bx寄存器的内容以10进制形式在显示器上输出使用递归算法,共45条指令程序在masm5.1 link3.60 环境下调试通过-assembly language bx to register with the contents of 10 band forms on the screen output using recursive algorithm, a total of 45 procedures in order masm5.1 link3.60 through debu
guji
- 系统辨识中,递推最小二乘估计(RLS)是辨识模型阶次的一个重要的算法。该程序通过实现该算法,得到模型阶次的估计值以及相关参数值。-system identification, recursive least squares estimation (RLS) identification model is of the order of an important algorithm. The program through the realization of the algorithm, to