搜索资源列表
fibonacci
- 优化的fibonacci数列计算程序，可以较短时间计算出较大的数字-Fibonacci series, optimization program that can calculate the short time a large number of
Fibonacci
- 最优化fibonacci 算法程序 -最优化fibonacci 算法程序最优化fibonacci 算法程序
Fibonacci
- 斐波那契数列的递归和迭代实现，C++语言，-Fibonacci series of recursive and iterative implementation, C++ language,
Fibonacci
- 斐波那契数的三种方法性能比较，分别是矩阵法，自底向上法和直接递归法-three fibonacci methods
Fibonacci
- 计算通过3种方法计算高位，斐波那契数，简洁明了。逐项递归法，对分递归法和公式计算法-Calculated by three methods calculating high, Fibonacci numbers, concise. One by one recursion, recursive methods and formulas for points calculation
1--Fibonacci
- C简单写的Fibonacci数的递归算法-C write simple of the number of the Fibonacci recursion algorithm
Fibonacci
- Fibonacci数列求解代码，递归调用和迭代算法-Fibonacci Fibonacci Fibonacci
Fibonacci
- 菲波那契数列如下：1,1,2,3,5,8,13,21,34......其中a[1] = 1, a[2] = 1, a[n]=a[n-1]+a[n-2]（n>=3）。对给定的下标n，求解a[n] 1997的值. -Fibonacci numbers are as follows: 1,1,2,3,5,8,13,21,34 ...... which a [1] = 1, a [2] = 1, a [n] = a [n-1]+ a [n-2] (n> = 3). For a given
Fibonacci
- Fibonacci为1200年代的欧洲数学家，在他的着作中曾经提到：「若有一只免子每个月生一只小免 子，一个月后小免子也开始生产。起初只有一只免子，一个月后就有两只免子，二个月后有三 只免子，三个月后有五只免子（小免子投入生产）-The Fibonacci European mathematicians for 1200 years, he s with has mentioned: "if a free child per month students a small free S
Fibonacci
- 4阶斐波那契序列如下：f0=f1=f2=0, f3=1,…,fi=fi-1+fi-2+fi-3+fi-4， 利用容量为k=4的循环队列，构造序列的前n+1项（f0, f1 , f2 ,… fn ），要求满足fn ≤200而fn+1 >200。 -4-order Fibonacci sequence is as follows: f0 = f1 = f2 = 0, f3 = 1, ..., fi = fi-1+ fi 2+ fi-3+ fi-4, With size k = 4
Fibonacci
- 斐波那契数列算法，很经典，用VC编写，适合初学者-Fibonacci Fibonacci series algorithm, very classic, suitable for beginners, prepared by VC
fibonacci-heap
- 斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。-Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.
Fibonacci
- 利用递归产生斐波那契数列的一个小程序。希望能有帮助-Recursive Fibonacci sequence produces a small program.Hope can be helpful.
fibonacci
- 迭代求fibonacci的数列的和 用矩阵求fibonacci百万项的和-sum of fibonacci
Fibonacci-sequence
- 此程序为C++语言的程序，可以输出斐波那契数列，特点是采用线性表的数据结构处理加法运算，对每一位数进行运算，并进位，解决了由于int或long int甚至unsigned long int(0~2^32-1=4294967295)的精度范围限制，此算法的精度范围主要受项数n(int)的范围(1~2^31-1=2147483647)影响-This program is C++ language program, you can output the Fibonacci sequence, is c
Fibonacci
- 斐波那契数列Fibonacci Sequence的Java语言呈现-Fibonacci number Fibonacci sequence Java language presentation
Fibonacci-generator
- 用于生成斐波那契数列，可以简化生成斐波那契数列的过程-Used to generate the Fibonacci sequence, simplify manual operation
Achieve-Fibonacci-function
- 实现斐波那契函数，在vc和2012上均可使用-Achieve Fibonacci function, can be used in the vc and 2012
The-Fibonacci-sequence
- 输入一个数字N，可以显示出斐波那契数列前N项的和，C++代码-Input a number 1 to n, then output the sum of the former n unmbers in The Fibonacci sequence
Fibonacci-sequence
- 用C语言实现的斐波那契数列，可以输入数字，产生相应阶的斐波那契数列。-Using C language implementation of the Fibonacci sequence, you can enter the number, generates the corresponding order Fibonacci sequence.