搜索资源列表
TowersofHanoi
- classic game of recursion, tower of hanoi
Greatest-common-divisor-(GCD)
- 用递归调用和辗转相除法求两个整数的最大公约数（输入多组数据，每个数在1到1000之间；输出为一行一个公约数）。-Calculate and output the greatest common divisor (GCD) of a pair of integers.The classic algorithm for computing the GCD, known as Euclid’s algorithm, goes as follows: Let m and n be variables c
Linear-Prediction
- Linear Prediction using Levinson Durbin Recursion and Lattice Filters
MergeSortTest
- 用C++实现了非递归归并排序算法，20万条数据花费时间78ms, 对初学算法的有一定的帮助！-use C++ language to implemente the merge sort algorithm without recursion! This algorithm only cost 78ms to manage 200000 data items.
maze
- 建立一个迷宫，并用递归算法找出一条走出迷宫的路线。-Build a maze and find a way out with recursion method.
Job_exercise1
- 同质链表以及异质链表，主要包括创建、插入、删除、倒置、拼接等操作。-homolinkedlist and heterolinkedlist，including creation，insertion，deletion，recursion，combination
Fibonacci-series
- 斐波那契数列 递归调用，主要用于了解递归用法-The Fibonacci series recursive calls, mainly used to understand recursion usage
CPP
- 列出了C++基本算法的一些源代码如递归，跳转-Listed C++ basic algorithm source code, such as recursion, jump
Nqueen
- 给出了用三种方法实现的N皇后，包括循环、递归、位运算等，方便初学者进行研究学习。-Three ways to achieve the N-Queens, including loops, recursion, bit operation, easy for beginners to study learning.
hierarchicalCentroid
- Descr iptor for simple shapes (e.g letters). Computes the descr iptor twice in order to describe horizontally and vertically with the same accuracy. Input: image (2-D, binary or gray) depth of recursion (default 7), plotFlag(if on -
kuai_suan_24
- 小时候玩过的加减乘除快算24游戏。这里的算法不是用的正统的递归或穷尽。 -The child played the addition and subtraction multiplication and division as fast as count 24 games. Here algorithm is not used in orthodox recursion or exhaustive.
Large-integer-factorial
- 本实例实现了一个计算大整数阶乘的程序。通常使用递归来计算一个整数的阶乘。但是， 因为ii.算本身能够表示的最大整数是有限的，所以能够计算的阶乘整数要受到限制。本程序使 用数组来存储结果，因而很好地解决了这个问题,只要有足够大的数组就能计.任意大的整数0-Examples of the realization of a to calculate large integer factorial program. Usually use recursion to calculate the facto
suanfa
- 算法程序与设计试验中的经典算法的源代码：像是分治递归，贪心，回溯等。-Algorithm design test of the classical algorithm source code: such as divide and conquer recursion, greedy, backtracking.
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem. Recursion and divide and conq
QuickSort
- Quicksort is a divide and conquer algorithm. Quicksort first divides a large list into two smaller sub-lists: the low elements and the high elements. Quicksort can then recursively sort the sub-lists. The steps are: Pick an element, called a pivo
Sierpinski
- Sierpinski镂垫： 是一个非常有趣的图案， 有着悠久的历史， 在分形几何中等领域里引起了人们极大地兴趣， 是用递归和随机方式定义的几何形状， 在极限情况下， 它所表现的性质并没有随机性。 -Sierpinski gasket: It is a very interesting pattern, has a long history in the field of fractal geometry moderate aroused great interest is the use
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
hw2
- 最优算法的判别与给出特定文法判断其是否为自下而上的递归-Identification and optimal algorithm gives specific grammar determine whether it is a bottom-up recursion
recursion
- 数据结构中的递归与非递归的实现与区别以及动态规划的思想。-Recursive data structures and non-recursive and differences as well as the realization of the idea of dynamic programming.
hannuota
- 汉诺塔递归算法 初学者学习递归很不错的源码-Tower of Hanoi recursive algorithm for beginners to learn recursion is a good source