搜索资源列表
dgfxs
- 递归实现分型树，由一个主干开始生成一棵完整的树-Typing recursion tree, from a trunk to start generating a full tree
queen
- 八皇后问题的具体实现，用递归来寻找每个皇后的位置，有注释！-Concrete realization of the eight queens problem, using recursion to find the location of each of the Queen, there are comments!
Commonalgorithms
- 一些常用的算法设计方法和C++环境下的实现方法。主要包括：迭代法、穷举搜、索法、递推法、递归、回溯法、贪婪法、分治法 -Some commonly used algorithm design methods and C environments are implemented. These mainly include: iterative method, exhaustive search, rope method, recursive method, recursion, backtra
lq
- 对于给出的一组数据，要找到它们的最大或者最小值，运用递归和分治的思想方法来解决问题。n=2时，一次比较就可以找出两个数据元素的最大元和最小元。 当n>2时，可以把n个数据元素分为大致相等的两半， 一半有?n/2?个数据元素，而另一半有?n/2?个数据元素。 先分别找出各自组中的最大元和最小元，然后 将两个最大元进行比较，就可得n个元素的最大元； 将两个最小元进行比较，就可得n个元素的最小元。-For a given set of data to find their maximum or
gcd
- to get GCD(A,B)，and no recursion -to get GCD(A,B),and no recursion
maze
- 迷宫问题的递归解法，输入一个1，0矩阵构成的迷宫，0代表可走，1代表不可以走，通过递归找出从入口到出口的路径，并输出-Recursive solution of the maze problem, enter a maze of 1,0 matrices, 0 representatives may go a representative can not walk through the recursion to find the path from the entrance to the ex
hano
- 这是一个不利用递归实现汗诺塔的例子，让我们看看原来简单的 hanoi (n-1,a,c) hanoi (n,a,b) hanoi (n-1,c,b) 由于无法使用递归，需要什么样的手段才能实现。-This is a non-recursive implementation Khan, Tower of Hanoi example, let' s take a look at the original simple hanoi (n-1, a, c) hanoi
test1
- 递归实现一个集合的所有的子集的输出。 例如{1，2} 输出{}{1}{2}{1，2}-A subset of the output of recursion
QuickSort1
- 一种速度很快的排序算法，无论是从空间和时间上。运用递归，循环，指针-A very fast sorting algorithm, both in space and time. The use of recursion, loop, pointer
Hanio
- 汉诺塔游戏的设计 汉诺塔问题是最经典的递归问题-Tower of Hanoi Tower of Hanoi game design is the most classic recursion problem
RandomizedQuicksort
- The steps are: 1. Pick an element, called a pivot, from the list. 2. Reorder the list so that all elements which are less than the pivot come before the pivot and so that all elements greater than the pivot come after it (equal values can go ei
hanoi
- Hanoi塔的递归调用和消除尾递归的方法，附带算法的设计思路和分析-Hanoi Tower recursive calls and the elimination of tail recursion method with the algorithm design and analysis of ideas
acm..
- 自相关法求全极点模型参数； 下行递归； 逆Levinson-Durbin递归（模型参数~自相关序列）； 平均周期图的Bartlett方法； Blackman-Tukey功率谱估计。-Autocorrelation perfection pole model parameters downward recursion inverse Levinson-Durbin recursion (model parameters ~ autocorrelation sequence)
Data_Structure_C
- 基本数据结构的C实现。包括: （1）线性顺序表 （2）单链表 （3）双向循环链表 （4）顺序栈 （5）链式队列 （6）循环队列 （7）二叉树的先序、中序、后序的递归遍历和非递归遍历。-C-realization of the basic data structure. Include: (1)Sq_List (2)Linked_List (3)Du_linkedlist (4)Sq_Stack (5)Linked_Queue (6)Cycl
Sierpinskiditan
- 给定不同的递归深度，通过使用海绵算法，绘制Sierpinski地毯，在三维环境中按照画家算法绘制20个小立方体-Given the different recursion depth, by using the sponge method, drawing Sierpinski carpet, in the three-dimensional environment, according to Painter' s algorithm draw 20 small cubes
zuidashang
- 最大熵是图像阈值分割里常用的一种简单且效果明显的方法。该代码是最大熵算法的快速递推形式。-Maximum Entropy is Image Threshold Segmentation ri common a simple and obvious effect method. The code is maximum entropy algorithm rapid recursion forms.
DE
- 用数组模拟递归函数，实现递归函数的简化算法，具体要求看英文描述。-We all love recursion! Don t we? Consider a three-parameter recursive function w(a, b, c): if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns: 1 if a > 20 or b > 20 or c > 20
hanruota
- 递归经典例子--汉诺塔程序，用C#写成，可视化界面。-Classic example of recursion- Tower of Hanoi program, written using C#, visual interface.
A_class_of_Linear_ODE_WITH_Finite_Recursion
- 求一类常系数线性常微分方程特解的有限递推法-A class of Linear Ordinary Differential Equations with Finite Recursion
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming