搜索资源列表
N_queue
- 根据回朔法思想来求解Ｎ皇后问题，用递归来实现回朔．-Thought to solve N Queen's problems, and use recursion to achieve back Schomburg.
新建 RTF 文档 (3)
- 这是一个典型的非数值问题，如果使用非递归算法求解此问题，要设计复杂的算法，编写很长的程序。而使用递归算法可以使整个算法清晰，使程序简洁。本问题分析并建立递归算法的过程是典型的抽取问题本质、建立递归算法 并最终解决非数值问题递归实例。-This is a typical non_numerical value problem.you must design complicated arithmetic and long program i
The C Programming Language-C语言详解英文版
- 这是一本讲解C语言的书，是英文编写，十分经典，是大部分公司的新职员入职之前必须要看的书籍之一，很多公司都以它作为培训教材，帮助你更快了解C语言的奥妙。 Contents l Preface l Preface to the first edition l Introduction 1. Chapter 1: A Tutorial Introduction 1. Getting Started 2. Variables and Arith
hanoi
- 不利用递归实现汗诺塔- Does not use the recursion realization perspiration promise tower
Findfile
- Findfile 利用递归算法查找文件的例子，d5及以上支持-Findfile use recursion algorithm search document example, d5 and above supports
bwc
- 搜索算法部分使用minmax递归，alphabeta剪枝，初期和中期搜索6层，最后部分搜索15层。评估算法主要是最小行动力，加以位置值的相关判断- The search algorithm partially uses the minmax recursion, the alphabeta pruning, the initial period and the intermediate stage searches 6, final
SMART
- 快速查找：应用递归排序的例子- Quick look: Application recursion arrangement example
Recursion
- 快速DCT变换 迭代算法- Fast DCT transformation iteration algorithm
BST - Bina2889710132001
- Binary Search Tree - with additional recursion functions (smallest, parent & successor) etc-Binary Search Tree- with additional recursion functions (smallest, parent & successor) etc
ALGO3-9
- 用递归求解迷宫算法原代码-using recursive algorithm to solve the maze-source
scantree
- This a small program which scans a particular section of your hard disk ( a tree) using recursion and returns information like the total number of files, folders, used disk space in that tree.
hanno
- 这是一个汉诺塔游戏的原代码,tc环境.可是图型界面的哦~~,不要认为是一般的递归了!-HANOR the original game code, tc environment. However, the map-based interface ~ ~ Oh, do not believe that the general recursion!
贴片法画球（OpenGL)
- 不是用递归，改用贴片法。也是很基本的离散方法-not use recursion using the patch method. Only basic discrete methods
N_queue
- 根据回朔法思想来求解Ｎ皇后问题，用递归来实现回朔．-Thought to solve N Queen's problems, and use recursion to achieve back Schomburg.
新建 RTF 文档 (3)
- 这是一个典型的非数值问题，如果使用非递归算法求解此问题，要设计复杂的算法，编写很长的程序。而使用递归算法可以使整个算法清晰，使程序简洁。本问题分析并建立递归算法的过程是典型的抽取问题本质、建立递归算法 并最终解决非数值问题递归实例。-This is a typical non_numerical value problem.you must design complicated arithmetic and long program i
换位递归
- 此程序是用排序实现换位递规的的版本， 对程序的操作有一定的帮助作用-This program realizes the conversion recursion by sorting, making some use to operation of program.
lhh5
- 动态数组 用函数递归和非递归的方法求两个整数的最大公约数-Dynamic array, compute the largest common divisor of two intergal by recursion and non-recursion.
二叉树1212
- 建立二叉树，层序、先序遍历（ 用递归或非递归的方法都可以-establish binary tree, sequence, the preorder (with the recursive and non- recursive method can be
如何返回目录大小
- 用C#写的返回目录大小(包括子目录) 用到递归,速度一般-written in C# size of the back catalog (including subdirectories) uses recursion, the pace
lianliankan1
- 利用递归来求的，其实连连看的搜索算法也就是搜索从一个点到另外一个点的不超过两次转弯的最短距离！-use recursion to seek the 1000 block of Terry Avenue fact, the search algorithm is a search from one point to another point of not more than twice the minimum distance betw