搜索资源列表
Fibonacci
- 通过模板类，获取斐波那契数列任意位的数，还可以修改成任意数列的类-By the template class, gets the Fibonacci sequence any number of bits can also be modified into an arbitrary sequence of classes
Fibonacci
- 运筹学->常用一维搜索算法->斐波那契数列法C语言实现-Operations Research-> common one-dimensional search algorithm-> Fibonacci sequence France C language
Fibonacci-sequence
- 递归调用产生斐波那契数列和循环产生斐波那契数列的效率的比对，输入要产生的斐波那契数列的位数-Recursive call produces Fibonacci sequence and cycling Fibonacci series comparing the efficiency of input to generate Fibonacci sequence of digits
feibonaqi
- 斐波那契数列，用VErilog语言实现非常好-Fibonacci sequence, using VErilog language is very good ha ha ha ha ha ha ha
fibonacii
- 数据结构课程，利用矩阵乘法实现斐波那契数列，包含word文档讲解-Data structure course, the use of matrix multiplication to achieve the Fibonacci sequence, containing word document to explain
yy
- 斐波那契数列指的是这样一个数列：1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... -Fibonacci column refers to such a sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...
Recursive-Fibonacci-sequence
- 斐波那契数列递归,采用c语言编写,注释齐全-Recursive Fibonacci sequence, using c language, complete notes
algrithem
- 凯萨尔加密方法、找硬币问题、n!算法、斐波那契数列、不同进制转换-some algrithm in c++
fibonacci-recursion
- 斐波那契数列的递归算法实现的源代码，计算机算法设计与分析作业1-Fibonacci series recursive algorithm source code, design and analysis of computer algorithms operating 1
Fibonacci
- 著名的Fibonacci数列，定义如下 f(1)=1,f(2)=1,f(n)=f(n-1)+f(n-2)，n>2 用文字来说，就是斐波那契数列由 0 和 1 开始，之后的斐波那契系数就由之前的两数相加。首几个斐波那契系数是： 0, 1, 1, 2, 3, 5, 8, 13, 21-The famous Fibonacci sequence, defined as f (1) = 1, f (2) = 1, f (n) = f (n-1)+f (n-2), n> 2 wor
Fibonacci
- 利用递归产生斐波那契数列的一个小程序。希望能有帮助-Recursive Fibonacci sequence produces a small program.Hope can be helpful.
lab_1
- 斐波那契数列计算，并计算每次执行斐波那契数列函数的执行时间，有递归和非递归两种算法，可以比较二者的执行效率。-Fibonacci number calculation and calculate the execution time of each Fibonacci series of executive function, there are two kinds of recursive and non-recursive algorithm can compare the efficien
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-number-sequence
- 产生指定数目的斐波那契数列。输入想产生的数字个数，则会输出相应的斐波那契数列，同时绘制数列曲线图。-Fibonacci generating a specified number of sequence. Enter the number of digits to produce, it will output the corresponding Fibonacci series, at the same time sequence graph drawing.
1
- 通过读取文本中的数值，实现斐波那契数列前90项的求值问题- By reading the text values to achieve the Fibonacci sequence is evaluated before the 90 questions
Fibonacci
- 斐波那契数列的高效求解，动态规划。还有一份代码是递归求解-Fibonacci DP Dynamic programming，
Fabnacci
- 斐波那契数列求解，给定一个索引地址，求出斐波那契数列中对应索引的值-Fabnacci array
Test3
- 求斐波那契数列第n项，n<30，斐波那契数列前10项为 1,1,2,3,5,8,13,21,34,-O the Fibonacci sequence n, n < 30, before the Fibonacci sequence,1,2,3,5,8,13,21,34,55 10 to 1
Fibonacci
- 斐波那契数列，又称黄金分割数列，指的是这样一个数列：0、1 、2、3、5、8、13、21、-In mathematics, the Fibonacci numbers or Fibonacci series or Fibonacci sequence are the numbers in the following integer sequence.
Pengfei_Gao
- 斐波那契数列的一个c++小程序，上课做的，希望对大家有帮助-A c++ small program Fibonacci series, the classes do, we hope to help