搜索资源列表
fibonacci
- 斐波那契函数的几种实现方法,提高效率的方法-ser methods for fibonacci
fibonacci
- Optimization problem with fibonacci method. Easy to understand.
Fibonacci
- 输入 20~30之间的n 值, 用递归计算 Fibonacci 数, 以十进制数输出.-Enter n values between 20 to 30, using recursive calculation of Fibonacci numbers to decimal number.
Fibonacci
- 经典的C语言面试基础算法及代码之计算Fibonacci数列-Calculation classic C language interview based algorithm and the code of the Fibonacci sequence
Fibonacci
- 试利用循环队列编写求k阶斐波那契序列中前n+1项的算法。 要求满足: (注意:本题所用循环队列的容量仅为k, 则在算法执行结束时,留在循环队列中的元素应是所求k阶斐波那契序列中的最后k项)-Try using a circulating queue write seeking algorithms k n+ 1-order Fibonacci term lease before that sequence. Requirements are met: (Note: This qu
fibonacci
- Fibonacci search method .rar
fibonacci
- Fibonacci in Verilog HDL
Fibonacci-sequence
- 斐波那契数列指的是这样一个数列:1、1、2、3、5、8、13、21、34…… 这个数列从第三项开始,每一项都等于前两项之和。 给出一个正整数n,要求菲波那契数列中第n个数是多少。 - Fibonacci sequence refers to such a series: 1,1,2,3,5,8,13,21,34 ...... This sequence begins with the third term, each equal to the sum of the
Fibonacci
- (1) clkdiv 模块:对50MHz 系统时钟 进行分频,分别得到190Hz,3Hz 信号。190Hz 信号用于动态扫描模块位选信号,3Hz 信号用于fib 模块。 (2) fib 模块:依据实验原理所述Fibonacci 数列原理,用VHDL 语言实现数列 (3) binbcd14:实现二进制码到BCD 码的转换,用于数码管显示。 (4) x7segbc:采用动态扫描,使用4 位数码管依次显示Fibonacci 数列数据。 实验采用3Hz 频率来产生Fibonacci
Fibonacci
- 斐波那契数列的非递归计算方法。既没有用递归形式,也没有用栈。-Non- recursive Computing Method for Fibonacci Sequence.
Fibonacci
- Fibonacci search method matlab
fibonacci
- 斐波那契数列产生,输入阶数,程序输出斐波那契数列。-Fibonacci sequence generation, input order, program output Fibonacci sequence.
fibonacci和goldmin
- 黄金分割法和斐波那契优化方法的matlab版本(goldmin and fibonacci)
SEQUêNCIA DE FIBONACCI (2)
- Another example of how to write a program that generates numbers in the Fibonacci sequence. It is one more example using the lingugem C.
1Fibonacci
- 这个程序的作用是由用户输入一个值作为fibonacci数列的参数,然后程序自动计算出其结果,打印至屏幕。(The function of this program is that the user inputs a value as the parameter of the Fibonacci series, then the program automatically calculates the result and prints it to the screen.)
Fibonacci
- Prints out the Fibonacci sequence.
sample-fibonacci.tar
- Matrix multiplication algorithm in c for mpi
实验3
- 斐波那契数列f(n)满足以下定义: f(0) = 1, f(1) = 1, f(n) = f(n-1) + f(n-2) (n >= 2)。 本题的数据规模比原先更大 输入描述 每行输入一个整数 n 0 <= n<= 80 输出描述 对于每一行输入,输出斐波那契数列第n项的值f(n)(Fibonacci sequence f(0) = 1, f(1) = 1, f(n) = f(n-1) + f(n-2) (n >= 2))
Fib2
- 递归和非递归两种方式实现Fibonacci数列算法。。。(Recursive and non recursive two ways to achieve)
Fibo
- how to build a fibonacci application for java