搜索资源列表
recursion
- 经典递归算法的C源码实现“迷宫求解”和“图像去噪音的问题”。-Classical recursive algorithm of C source code to achieve "maze solving" and "clean up the noise of images".
totalarrange-recursion-backtracking
- 在排列树上递归回溯搜索全排列问题的全部解-Recursive backtracking search tree in the arrangement of the whole array of all solutions of the problem
compiling
- 编译原理实验:词法分析、语法分析、语义分析,包含代码和报告、构建分析表、消除左递归、语法分析、流程图-Compiler Principle Experiment: lexical analysis, syntax analysis, semantic analysis, including code and reports, construction of the table, to eliminate left-recursion, parsing, flow chart
2010quicksort
- c++用栈代替递归实现的快速排序,快速排序是一种比较节约时间的排序,一般用递归的方法实现,用栈虽然占用空间比递归大,但不要像递归一样把大多的时间浪费在递归的过程中,特别是对数字比较多的排序更有效-Recursive stack instead of using quick sort, quick sort is a kind of sorting to save time, usually with a recursive method to achieve, although the use
zidian
- 6-12位密码字典生成程序,递归实现 0-9 a-z A-Z -6-12 bit code dictionary generation procedure, recursion
daogelas
- GIS中道格拉斯 压缩算法,采用递归。本程序以30个数据点为元数据。-GIS in Douglas compression algorithm using recursion,The program to 30 data points for the metadata
saolei
- c语言程序编写扫雷小游戏,主要用递归调用,结构体,局部清屏-C programming demining small game, mainly using recursion, structures, local screen clearing
ClosetPairs
- 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序,使得所有的点是按x坐标从小到大排好序的(x坐标相同时y坐标小的排前),然后取下标小于n/2属于左边的点集PL,取下标大于n/2属于右边的点集PR,即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法,分别求出PL和PR中的最近点对,最终通过递归实现。-This algorithm uses divide and conquer to solve the probl
LMS-FTF-LSL
- 包括:三种LMS算法实现AR(2)的预测,法2、3用递推计算Km,两者区别在于d(n)的取法略微不同;用LSL和FTF算法实现简单的系统辨识。-Include: three LMS algorithm AR (2) the forecast, France 2,3 calculated with recursion Km, whichever is the difference between d (n) of a slightly different取法 LSL and the FTF al
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, finally partially searches 15. Appr
SMART
- 快速查找:应用递归排序的例子- Quick look: Application recursion arrangement example
visualc++
- 通过编程实现递归与分治策略的有关算法,理解递归与分治策略算法的原理,掌握递归与分治策略基本思想与应用技巧。 -Through the realization of recursive programming strategy and separation of the relevant algorithms, understanding of the recursive algorithm with sub-rule strategy of the principle of recursion
main
- 关于sort算法的所有实现,有quick,selection,递归等-Sort algorithm on all the achievement, a quick, selection, recursion, etc.
Bitree
- 实现各种二叉树的遍历。包括先序遍历、中序遍历、后序遍历的递归或递 归算法。-To achieve a variety of binary tree traversal. Including the first traversal, in order traversal, postorder traversal of the recursion or recursive algorithm.
1
- 一个递归小程序,主要说明递归的实现,怎样将递归用栈实现非递归-A small-recursive procedures, recursive realization of the main note, how to use recursion stack to achieve non-recursive
Cchengxu
- 这个程序包包括了C语言中的一些常见的程序,如阶乘,读取二进制文件,递归,二维数组平均值排序等几十个程序。有了这些程序,会更好的进行科学计算-This package includes the C language of some common procedures, such as factorial, read binary files, recursion, sorting, such as the average of two-dimensional array of dozens of
BaHuangHou
- 题目:八皇后问题。 八皇后问题是指求解如何在国际象棋8*8棋盘上无冲突的放置八个皇后棋子。因为在国际象棋里,皇后的移动方式是横竖交叉,所以在任意一个皇后所在的位置的水平,竖直和斜45度都不能有其他棋子的存在。一个完整的无冲突的八皇后棋子分布成为八皇后问题的一个解。设计思路:我使用了回溯的方法来解决八皇后问题,也就是逐次试探的方法。这个方法是通过函数putchess()对自身的递归调用来实现的。运行程序后,主函数调用putchess()函数在棋盘第一行第一列上放置棋子,开始向下一行递归。每一步
2816
- poj2816,解决红与黑问题,经典的递归问题 -poj2816, solve the problem Red and Black, classic recursion problem