搜索资源列表
JAVA递归
- 这是一个递归结构求斐波那契数列中的数列中的前10个数。-This is a recursive structure for Fibonacci series, the series of 10 numbers.
fib序列
- 数据结构算法：使用循环队列，K阶斐波那契数列的一种算法实现。-algorithm data structure : the use of recycled cohort, K bands Fibonacci series, a method.
javaFibona
- 用java程序实现计算斐波那契数列的递归程序-using java program calculated Fibonacci series, the recursive procedure
Sfibo
- 用java程序现实的计算斐波那契数列的非递归程序-with java realistic calculation procedures Fibonacci series of non - recursive procedure
5
- 第五章练习题，包括哥德巴赫猜想，汉英对照星期，pi的近似值，暂停时间秒的过程，利用计算阶乘的自定义函数求e，5个人岁数，斐波那契数列，最大公约数，最小公倍数
fibonacci_2
- 本程序是用备忘录法实现计算斐波那契数列，大大缩短了运算时间。
sousuo
- 一维搜索法求极值的问题，用c++描述，黄金分割法和斐波那契数列发求-One-dimensional search for the extremum problem, using c++ descr iption, golden section method and the Fibonacci sequence for hair
fib
- 汇编语言球斐波那契数列和。汇编语言程序设计-Assembly Language ball Fibonacci series and
Kfibonacci
- K阶斐波那契数列的前K-1项均为0,第k项为1,以后的每一项都是前K项的和-K-order Fibonacci sequence of the former K-1 item are 0, the first k items for 1, after each of the items are pre-K and
1
- 汇编的斐波那契数列，本人上机作业-Compiled by the Fibonacci sequence, I am on the machine operation
Fibonacci
- 斐波那契数列，包含头文件、算法实现文件及主函数文件。 -Fibonacci sequence, including the header files, the algorithm to achieve the main function of documents and files.
stackfibnaqi
- 斐波那契数列计算的非递归算法 用栈来模拟递归的经典题目-Fibonacci calculation of non-recursive algorithm used to simulate the recursion stack classic topic
deidai
- WXH-斐波那契数列.Koch曲线 动态的Von Koch分形曲线,中点法生成Sierpinski地毯 分形蝴蝶 -WXH-Fibonacci sequence. Koch curve dynamic Von Koch fractal curve, the mid-point method to generate fractal Sierpinski carpet Butterfly
Fibonacci
- 取石子游戏之必胜策略 采用斐波那契数列作为算法-The winning strategy game to take stones used Fibonacci sequence as an algorithm
fibonacci
- 经典的斐波那契数列算法，使用c++语言编写。希望对大家有用-Classic Fibonacci sequence algorithm, using c++ language. Want to be useful to everyone
java
- 判断斐波那契数列在第几项开始，值大于1000 -to decide Fibonacci sequence
java
- 里面包含了很多程序，包括斐波那契数列，还有很多一维数组和二维数组的最大，最小输出。-Which contains a lot of procedures, including the Fibonacci sequence, there are many one-dimensional array and two-dimensional array of maximum and minimum output.
Fibonacci
- 斐波那契数列，递归算法，包括全部文件，可以直接使用-Fibonacci series, recursive algorithms, including all files, can be used directly
fibo
- 斐波那契数列,简单地说,起始两项为0和1,此后的项分别为它的前两项之后。本算法使用递归算法实现。(The Fibonacci sequence, simply said, starting two to 0 and 1, then were the top two after it. This algorithm is implemented by recursive algorithm.)
Desktop
- 斐波那契数是0、1、1、2、3、5、8、13、21，用递归方法可以定义为F0=0，F1=1，Fn=F(n-1)+F(n-2)（n>=2，n∈N*），此程序作用为算出第n个斐波那契数的数值并输出(Calculate the n value and output Fibonacci number)