搜索资源列表
-
0下载：
利用递归来求的，其实连连看的搜索算法也就是搜索从一个点到另外一个点的不超过两次转弯的最短距离！-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 between turning!
-
-
0下载：
主要描述递归的概念，
掌握设计有效算法的分治策略。
通过下面的范例学习分治策略设计技巧。-Will describe the concept of recursion to master the design of effective algorithm for sub-rule strategy. Examples of learning through the following sub-rule strategy of design skills.
-
-
0下载：
列出了C++基本算法的一些源代码如递归，跳转-Listed C++ basic algorithm source code, such as recursion, jump
-
-
0下载：
算法程序与设计试验中的经典算法的源代码：像是分治递归，贪心，回溯等。-Algorithm design test of the classical algorithm source code: such as divide and conquer recursion, greedy, backtracking.
-
-
0下载：
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
-
-
0下载：
最优算法的判别与给出特定文法判断其是否为自下而上的递归-Identification and optimal algorithm gives specific grammar determine whether it is a bottom-up recursion
-
-
0下载：
Calculating "The Sum of Its Parts" Prerequisites, Goals, and Outcomes Prerequisites: Students should have mastered the following prerequisite skills. Trees - Knowledge of tree representation, particularly general hierarchies STL map contain
-
-
0下载：
用这种算法编程,不用解方程组,只须用递推公式,并且当循环次数增加一
次时,只要把循环增加一次-Programming in this algorithm, without solution equations, just use recursion formula, and when cycles increaseTime, as long as to increase circulation. The rest remains the same.
-
-
0下载：
贪吃蛇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
-
