搜索资源列表
程序员之家 - 用VisualC++6_0递归查找目录树 论文
- 用递归查找目录树 这个小程序本人认为还不错 大家共享一下吧 有用的到的 尽量下吧 -using recursive search tree this small program, I think it is good share my views useful to the next as it
knap
- 用贪婪法的策论，用非递归实现背包问题的求解，并求出放如背包中的物品．-greedy law with political discourse, the use of non - recursive Knapsack Problem Solving and sought release if the items backpack.
maze4444
- 由系统随机建立一个迷宫,然后屏幕输出路径。为在完成作业的同时复习所学过的内容,完成一条路径的时候用到了递归的方法 而做全部路径的时候用非递归的方法。用户界面友好，有用户使用说明.每一步操作都有说明与提示。程序运行通过，有详细的解释说明-system by the establishment of a random maze, and then screen output path. For the complete review of operations at the same time ha
如何在treeview里面显示数据库字段
- 这里讲的是如何动态的把数据库的字段绑定到treeview中去。它利用了一个递归的算法来实现-talking here of how the dynamic field of the database bundled treeview to go. It uses a recursive algorithm to achieve
oriencombin
- 利用横向递归算法解决数据组合的问题， 比如数组为a, 长度为len， 横向递归 B display(a,len) b是二维数组，a是一维数组-the use of horizontal recursive algorithm to solve the problem of data sets, such as the array is a length of len, horizontal display recursive B (a, len) b is the two-dimensional
echsh
- 二叉树的各种遍历。递归和非递归遍历以及层次遍历。-the binary tree traversal. And recursive and non - recursive traversal level traverse.
gelei generator
- 该程序用递归的方法产生格雷码序列,它需要一定的额外的空间.-the procedures used recursive methods Gray code sequence, it needs the additional space.
inordervisit
- 该程序完成对二叉树的非递归中序遍历，因为其中涉及到二叉树的构造，而且使用类来构造，所以代码比较多。-completion of the process of non - recursive binary tree which preorder because it involved the construction of a binary tree, but the use of class structure, the code more.
preorder
- 该程序完成对二叉树的非递归的前序遍历，在三种遍历方法中，这种遍历最简单，所以，核心代码自然要少很多。-completion of the process of non - recursive binary tree of the former preorder, the three traverse method, which traverse the most simple, so natural to the core code is much less.
divide and conquer
- 这是一个分治法应用和递归的完美体现，它根据输入的数字在屏幕上打出美丽的图案。-this is a separate rule and the application of recursive the perfect embodiment of its import figures on the screen making beautiful designs.
combine
- 该程序用于计算二项式系数，它采用动态规划的方法，其效率远远高于递归的方法，而且空间效率也很高。-the procedures used to calculate the binomial coefficients, which uses dynamic programming methods, the efficiency is far higher than the recursive method and space efficiency is also high.
ddt
- 算法设计于分析中的多段图问题，用VC编写应用动态规划的算法设计方法，利用最优性原理以及所获得的递推关系式求取最优决策序列，通过多段图的定义，找到由源点s到汇点t的最小成本路径，进而可以灵活解决可以用多段图描述的许多实际问题.-algorithm design in the analysis of many of the map, prepared with VC dynamic programming algorithm design, the optimum principle as well
马踏棋盘（第2章）
- 1． 问题描述设计一个国际象棋的马踏遍棋盘的演示程序。2． 基本要求将马随机放在国际象棋8*8棋盘的某个方格中，马按走棋规则进行移动。编制非递归程序，求出马的行走路线，将数字1，2，3，4，…，64依次填入一个8*8方阵。-1. Problem descr iption design of a chess board Ma travels in the demonstration program. 2. Ma basic requirements on random chess 8 * 8 ch
cw_bitree
- 与清华大学版的《数据结构》匹配二叉树的实现：BITREE1.CPP：为主程序，其中实现了递归算法以及非递归算法的前序遍历，中序遍历，后序遍历。TSTACK1.H: 为头文件，其中定义了一些常量的值，其中也包括了书中第三章的栈的实现，只需要将注解符去掉即可。运行环境为：VC++6 或 TC3-and Tsinghua University version of the "data structure" matching the achievement of a binary t
N皇后问题的回溯法,非递归实现
- 这是N皇后问题的回溯法,非递归实现.此算法对初学者有难度,最好去参考书.这个问题也是回溯法的经典例题,推荐自己去实践.还有,我贴的程序在TC3.0下调试通过.-This the Queen's retroactive law, non - recursive. This algorithm is difficult for beginners, to the best reference books. This issue is also back classic example of
bypl0
- 按递归下降方式设计其编译程序，生成PL/0栈式指令代码，然后解释执行。用(a=1)+2*(b=3+4*5)/2+2*a*b-(a=a+5)/ (c=2) 测试-dropped by recursive approach to design their own compiler, generating PL / 0 Stack-code instructions, and then the interpretation and implementation. Using (a = 1) 2 * (
compile11
- 简单整型表达式文法按递归下降方式设计其编译程序，生成PL/0栈式指令代码，然后解释执行-simple integer expression by recursive grammar dropped to design its compiler, generating PL / 0 Stack-code instructions, and then the interpretation and implementation of
递推的极大似然法辨识程序
- matlab在系统辨识中的应用此处为递推的极大似然法应用的源代码及运行后结果（包括图像）-Matlab system identification in the application of recursive here Maximum Likelihood of the application's source code and running after the results (including images)
Applet表达式解析器
- java的Applet 表达式解析器. 采用递归下隆解析法.可以进行四刚运算. 乘方,括号等正刚运算-the expression parser. Under LAI using recursive analytic method. Four can just computing. Involution, brackets, etc. are just Operational
文件树的实现
- 以递归搜索的方法实现对目录的遍历,然后用treeview现实整个目录树.-recursive search for the right way to achieve directory traversal, and then use the treeview reality the whole directory tree.