搜索资源列表
整数转换为字符串
- 用递归将整数转换为字符串的C++程序 通过求得整数每位数,再将其转为ASCII码,再调换每位顺序-using recursive integral to the conversion to a string obtained by C program every few Integer, and then converted to ASCII and then swap each sequence
一维最近点(分治法)1
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法:分治方法1(该方法在递归时由于使用数组的值,使得递归进栈的数据很多,消耗系统空间很大,所以处理的个数经测试不超过70个,可见在设计程序时,考虑空间的使用也是很必要的!)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : a partition method (the me
一维最近点(分治法)2
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法:分治方法(找出中位数,两边递归)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : the administration (to identify the median on both sides, the recursive)
hc_compiler
- 由于时间紧迫及事先准备不足,编译器最后定型时暴露出不少问题及不足之处,主要有以下一些方面: 不支持数组数据类型,这是文法分析器设计时的一个疏漏,由于时间关系,最后只得把扫描器中已做好的相关的数组部分删去。 对于float数据类型的支持,直到语义分析都是正常的,也能生成相应的汇编代码,但由于我们对8086/8088指令系统本身了解不足,这样的汇编代码将只能做到含义上完全忠实于源程序,但不能运行。 对于局部变量的支持,则于时间紧迫,所有的局部变量全被处理成静态变量。使递归函数不能得到正确
Work4_lyl
- 采用递归的方法对正六边形进行填充,得到了一个很好看的图形。很有规则。-using recursive method is right for filled hexagons, was a very good graphics. Very rules.
数据结构的一些较难题答案
- 有许多是考研要用的!三路归并算法,快速排序的非递归算法,无向连通图的非递归的深度优先遍历等,,希望大家用得着-many are taking tests to use! Three road merging algorithm, rapid sequencing of non - recursive algorithm, undirected graph of the non - recursive depth-first traversal, and we hope that it needs
SimpleMaze007
- 迷宫的又一解法。该算法简单、实用、可读性强,是学习递归和回溯很好的例子。-maze of another solution. The algorithm is simple, practical and readable study is recursive and backtracking good example.
求菲波那契函数FIB(N)-(N from 1 to 24)
- 用汇编语言,并且递归求菲波那契函数FIB(N)---(N from 1 to 24) (huangyujie)-assembly language, and for recursive function Fibonacci FIB (N )---( N from 1 to 24) (huangyujie)
Java语言TSP递归程序的优化
- 因为递归程序运行的效率一般都比较低,本程序用java语言来实现TSP递归程序的优化-because recursive program run average efficiency are low, the procedure used java language to achieve TSP recursive process optimization
TreeCtrlEx
- 一个树形控件,和MFC的树形控件功能相同,但是可以隐藏节点,采用了四个指针,插入和删除算法没用递归,比较新颖-a tree controls, and MFC tree controls function the same, but hidden nodes can use the four indicators, insert and delete useless recursive algorithm, the novelty
NQueen非递归
- 算法中的n后问题,用非递归实现的,用一般的c++编译器都可以实现-n algorithm after issue, the non - recursive with the general c compiler can achieve
Option
- 一个小工具,可用于文件中文字内容的替换,支持多递归搜索文件-a small tool can be used to document text replacement, support multiple recursive search files
ReplaceFileName
- 一个小工具,可以批量替换WINDOWS系统中的文件,支持递归搜索替换-a small tool that can replace Windows system volume of documents to support recursive search Replacement
A逐点循环递归法求哈密顿回路
- 此文档是用VC编写的编译原理A逐点循环递归法求哈密顿回路的程序-This document was prepared by the compiler VC Principle A cycle-by-point method for recursive loop Hamiltonian procedures
递归的应用:最简单分形图形实现
- 递归的应用:最简单分形图形实现可实现图形的多方位显示-recursive applications : the most simple fractal graphics can be realized to achieve the multidimensional graphics display
大整数乘法
- n的阶乘.rar 可以求数的阶乘 是以递归算法为基础的 对学习算法设计与-n factorial. Rar can help factorial number of recursive algorithm is based on the learning algorithm design and
testcfindfileext
- 大家经常需要对指定目录下的所有文件进行搜索或其它相同操作。若文件数很多,逐一对每个文件手工操作,很费时。这里提供一个搜索或处理指定目录下的所有文件的C++类。作者用基于层次遍历的非递归算法(以减少运行时的时间和空间开销)实现了一个 CFileFind 的扩展类 CFileFindExt,该类可以对指定目录下的所有文件进行搜索或相同的处理操作。-designated directories on the search for all documents or other similar oper
叶子结点统计
- 递归算法求统计二叉树T中叶子结点的数目,数据结构常用算法-recursive algorithm for statistical binary tree T leaf node of the number of commonly used data structures Algorithm
treeview另一递归
- 一个通过递归实现的treeview!! 大家可以过来看看哟-through a recursive achieve treeview! ! We can look into yo
factorial
- 实现组合C(M,N)运算,程序结构简单鲜明,运用递归算法,取代流行的数组方式储存,实现组合运算-achieve portfolio C (M, N) Operational procedures simple structure distinctive, using recursive algorithm to replace the popular approach to storage arrays to achieve portfolio Operational .............