搜索资源列表
forfun
- 小程序Just for fun。递归解数独，编译环境为G-Applet Just for fun. Recursion solution Sudoku, the GCC compiler environment
the-maze-problem
- 功能：用递归方法实现对迷宫问题的求解。 内容说明：熟练递归特点；掌握递归与栈的关系。-Function: using recursive method to solve the maze problem. Content Descr iption: familiar with recursive characteristics master the relationship between recursion and stack.
code3
- Package consists of 3 files. First, to compare two linked list. Second, to find the reverse of a linked list using recursion. Third , to merge two sorted linked list
LS
- 最小二乘法辨识源程序：基本、不需求逆矩阵、辅助变量法、递推、广义-Parameter identification source: basic, does not require inverse matrix of instrumental variables, recursion, generalized
Interger-to-binary
- 该程序实现整数到二进制的转换，主要体现递归的思想。-The program to achieve integer to binary conversion, mainly embodies the idea of recursion
recursion
- 基于递归下降分析法的语法分析器，应用环境visual C-Decline analysis method based on recursive parser application environment visual C++
TANCHI
- 贪吃蛇algorithm using a dialog box to enter Koch curve and angle theta recursion depth n corresponding Koch curve plotted-snakealgorithm using a dialog box to enter Koch curve and angle theta recursion depth n corresponding Koch curve plotted
Light_XML_Encoding_deconding
- 将树形数据结构用于最小化 DOM 模型 XML 编解码器的开发。在解析 XML 文本时，基于 Expat 解释器将 XML 字符串构造成树 状结构；编码时构造 DOM 树结构，采用非递归深度优先法遍历树，将其串行化成 XML 串。本编解码器解决了国际化语言关键问题，是 一个通用、高效的工业级 XML 应用支撑模块。-This paper designs a DOM liked tree data structure for developing a minimal DOM based e
main
- 哈夫曼树，二叉哈夫曼树的建立（两种方式），以及三种遍历方式（递归与非递归）-The haffman tree, the creation of the binary hafman tree (two ways), and the three ways of traversing (recursion and non-recursion)
Loop-fractional
- 以十进制小数的形式输出两个自然数n/d的结果；如为循环小数，则将循环节括起来-Output the result of two natural numbers n/d in decimal decimals if it is a recursion, enclose the loop.
输出日历
- 该程序由C语言编写，利用递归，可以输出1971年以后的任意一年的日历表，包括月份、时间、星期几(The program written by the C language, using recursion, you can output any year after 1971 calendar table, including months, time, week)
DeleteTree
- 做项目时需要对tree树进行删除，因为在删除某个节点时，要对这个节点下的所有节点进行删除，所以使用了递归来获取所有需要删除的节点，然后只需对返回的集合进行操作即可，递归方法现已上传(Do the project need to delete the tree tree, because in removing a node, to all nodes on this node are deleted, so use recursion to obtain all need to delete n
sort
- 快速排序法和堆排序法Fortran90程序，其中快速排序法使用到了递归过程，因此对于堆栈要求较高(both Quicksort and Heapsort program are used for sort array. Note that a recursion process is used in Quicksort program, Thus it need require a relative high stack size.)
The Little Schemer
- LISP入门的读物，很好的学习递归理念的资料，英文正版，易于理解。(The reading of LISP, good learning of the idea of recursion, good English, easy to understand.)
grammar
- 第1章 算法引论 1.1 算法与程序 1.2 表达算法的抽象机制 1.3 描述算法 1.4 算法复杂性分析 小结 习题 第2章 递归与分治策略 2.1 速归的概念 2.2 分治法的基本思想 2.3 二分搜索技术 2.4 大整数的乘法 2.5 Strassen矩阵乘法 2.6 棋盘覆盖 2.7 合并排序 2.8 快速排序 2.9 线性时间选
FindFiles
- 通过递归查找文件的源代码，再Debug模式注意文件路径的深度，运行起来比较流畅，很有参考价值(The software can find files by recursion function; Take care the path depth when in debug mode; It can work smoothly and is good as a reference.)
数细胞
- Recursive problem solving, convenient, fast, easy to understand, you can have a better understanding of deep recursion.
recursion
- 几个c++递归算法，仅供参考，代码比较简单(Several c++ recursive algorithms, for reference only, relatively simple,good luck)
Hanoi
- A Hanoi sample. Using C++ and recursion.
C语言迭代法详细讲解
- C语言迭代法举例讲解和递归法举例讲解.对于学完C语言函数后,详细了解函数迭代法和 递归法解决一些问题.(C language iterations are illustrated with examples and examples of recursion. After learning the function of the C language, the function iteration and the function iteration are detailed. Recurs