搜索资源列表
NumeroFibonacci
- APLICACION PARA SABER SI UN NUMERO PERTENECE A LA SERIE FIBONACCI
Fibonacci-based_Moving_Averages-_Part_1
- Moving Averages- Part 1指标在主图表创建彩色均线组(Moving Averages- Part 1The main chart creates a color moving average set)
Fibonacci Golden Zone
- 一款不错的cci全周期超作系统！走势一目了然！(A good CCI full cycle super operating system!)
人工智能-prolog
- 利用prolog解决汉诺塔，斐波那契数列，阶乘等问题(The use of prolog to solve the Fibonacci sequence, Hanoi, factorial problem)
fib递归
- 利用递归求得第m项的斐波那契数并输出m的值(The item M and m using recursive Fibonacci number output value)
AlteraLab1
- To design Fibonacci Sequence using Verilog. SOFTWARES USED: Xilinx Synthesis Tool ISE 9.2i INTRODUCTION. Hardware descr iption language (HDL) is a general-purpose language intended to describe circuits textually,
01 斐波那契数列
- 斐波那契数列程序的实现方式，C++程序。。。。。。。(The Fibonacci program)
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.)
fbxzrjn7
- 这个程序是一个Win32程序,计算Fibonacci斐波纳契数列(一种整数数列, 其中每数等于前面两数之和),其定义是f(()
oveulofd
- 这个程序是一个Win32程序,计算Fibonacci斐波纳契数列(一种整数数列, 其中每数等于前面两数之和),其定义是f(()
New WinRAR ZIP archive
- this is good matlab code and for fibonacci series
fibonachi
- Fibonacci number calculator
斐波那契数列 (2)
- 斐波那契数列初步入门学习、了解，对语言的进一步了解有很大的帮助(The Fibonacci rudiments of learning, understanding, is of great help to further understand the language)
MatlabAlgorsCh4
- 各种典型通用的一维优化算法。如斐波那契搜索法，黄金分割搜索法，二次插值算法等(A variety of typical general-purpose one-dimensional optimization algorithms. Such as Fibonacci search method, golden section method, the two interpolation algorithm.)
斐波那契数列
- 计算斐波那契数列求和的简单c语言程序，喜欢的朋友可以下载看看(it is an easy program to calculate Fibonacci sequence)
斐波那契数
- 斐波那契数，能够求1-n的斐波那契数列以及时间，通过输入一个数值n，即可从1-n输出数列和所需时间。(Fibonacci, can 1-N the Fibonacci sequence and time, through a numerical input n can be output from the 1-n sequence and the time required.)
127Match the order in which the link
- the file describe reseau network
斐波那契数列
- 能够实现斐波那契数列，阿特姆郎数和汉诺塔游戏步骤的产生，用PYTHON语言编写，简介实用(Which can realize the Fibonacci sequence)
New folder
- verilog codes for counter,d flipflop,fibonacci series,prime numbers,top.
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)