搜索资源列表
1
- 利用OpenGL分形生成科赫雪花,可改变递归深度以及不可拖动-Using OpenGL Koch snowflake fractal generation can change the recursion depth and drag-Using OpenGL Koch snowflake fractal generation can not change the recursion depth, and drag-Using OpenGL Koch snowflake fractal gene
up
- A class with recursive member functions Member functions of C++ classes can be recursive. A typical use of recursion is to create a recursive private function to act as a helper for some other member function.-A class with recursive member f
BomExplorer
- BOM展开的递归和非递归算法,用于制造型企业的MRP计算;-BOM Explorer with recursion and non-recursion
Recursion
- 一个递归小程序,并且带有性能检测,一个比较差的程序。-A small recursive program, and with performance testing, a relatively poor program.
lab5
- CS 201 _ DATA STRUCTURES AND ALGORITHMS LAB5 Aim: Understanding recursion.
data-structure-
- 顺序表、单链表、双链表、队列、栈与递归、图等数据结构方面的源代码-Order form, a single linked list, double linked lists, queues, stacks and recursion, graph data structure such as source code
QuickSort
- 快排,快速排序算法,里面包含例子,并且有原始版本,有改进: 去除尾递归,有去除尾递归, 改进2):将较短的区间使用递归去排序. 较长的区间用循环去排序.-Fast discharge, fast sorting algorithm, which contains examples, and there is the original version, there are improvements: removal of tail recursion, there is removal of
Parametric-Methods
- MATLAB Code for Parametric Method of Spectrum estimatin. using Auto Regressive Method, Both levinson Durbin recursion and yule waker method,
main
- 二叉树的建立、遍历 实现递归、非递归的遍历,前序、中序和后序都要求实现-The establishment of a binary tree, traversal recursion, non-recursive traversal, preorder, inorder and postorder are required to achieve
order
- 计算机专业的必修课,数据结构中学习的一种递归遍历算法,采用c++编码。-The computer professional required course, data structure of learning in a kind of recursion traversing algorithm, the c++ coding.
Recursion-and-divided-.ppt
- 这是关于分治与递归算法的课件,文章详细的讲解了这两周算法的设计要点。-This is about divide and conquer and recursive algorithm courseware, the article explained in detail the design elements of the algorithm for two weeks.
BST
- binary search tree recursion
fortran
- 指针与递归 指针与递归 指针与递归 PPT -Pointers and recursionPointers and recursionPointers and recursionPointers and recursion PPT
Hanoi
- 这是一个简单的汉诺塔问题求解,用递归实现。 输入一个汉诺塔盘子的个数,然后求出具体的移动过程。-This is a simple Tower of Hanoi problem-solving, using recursion. Enter a Tower of Hanoi plate number, and then find the specific process of moving.
recursion
- 快速排序,汉诺塔以及汉诺塔的演示,内码转换-the exchange of the ISN,Hanoi_show
not-recursive-realized
- 该程序是分段函数: akm(m,n){ n+1 m =0 akm(m-1,1) m!=0,n=0 akm(m-1),(akm(m,n-1)) m!=0,n!=0 实现递归和非递归的算法 非递归算法可能使计算时间减少-The program is piecewise function: Akm (m, n) { N+ 1 m = 0 Akm (m-1, 1) m! = 0, n = 0 Akm (m-1) (akm (m, n-1)) m! = 0, n.=
Maze1
- 关于迷宫的递归,栈,队列的解法的一个小程序。-On the maze of recursion, stacks, queues the solution of a small program.
line
- Breshman画直线、画圆、简单种子填充、递归种子填充-Breshman draw a line to draw circles simple seed filling ,recursion seed filling,Breshman draw a line ,draw circles
bessel
- 美国学生上计算物理课,编写的球贝塞尔函数递归-Spherical Bessel functions via up and down recursion, taken from: "Projects in Computational Physics" by Landau and Paez, by John Wiley and Sons, New York.
saolei
- 以Visual C++ 6.0为开发环境,设计并开发一款扫雷游戏,其功能类似于Windows操作系统自带的扫雷游戏。论文首先介绍了制作游戏的整体思路及整个游戏设计的流程规划,然后介绍了雷区的布置以及地雷随机产生的实现方法;重点介绍了在游戏过程中各事件的处理,其中又以鼠标事件和清除未靠近地雷区方块这两方面最为最要,鼠标事件是利用鼠标所发出的信息了解使用者的意图,进而做出相对应的动作,而清除未靠近地雷区方块由于引进了“递归”这个概念而使其简单化。-What my thesis research fo