搜索资源列表
fib
- fibonacci alghoritm in c-fibonacci alghoritm in c++
4-6
- java程序设计网络编程课后习题fibonacci序列编程！-java programming network programming Problem fibonacci sequence of after-school programming!
main
- 用四种方法求Fibonacci数 用四种方法求Fibonacci数-Fibonacci number using four methods of seeking
Fibonacci_encryption
- 一种Fibonacci序列变换空域加密算法和解密算法。利用Fibonacci序列产生密钥，实现图像空域加密。-The airspace of a Fibonacci sequence transform encryption algorithm and decryption algorithm. The use of Fibonacci sequence generated key encryption to achieve the image airspace.
1234
- fibonacci In this project, you are required to compute the nth Fibonacci number according to a given non-negative integer n. I have mentioned 4 algorithms based on very different ideas. Please implement them by choosing the most convenient languag
FibIterative
- This is fibonacci code in an iterative method done by c
FibRecursive
- This fibonacci done in Recursive way done by c-This is fibonacci done in Recursive way done by c++
matlab
- MATLAB 实现Fibonacci法和0.618法-MATLAB realization of Fibonacci method and 0.618 France
3
- k阶斐波那契序列的实现，输入阶数以及上限，输出完整序列。-k-Fibonacci sequence to achieve, enter the order number as well as the maximum output of the full sequence.
FibonacciHeapApp
- 斐波那契堆及其在 图算法中的应用,最小生成树，最短路径等-Fibonacci heap and its application in graphic algorithm
xuhanshu
- 利用虚函数手段，按照3种不同的计算方法来求出Fibonacci数列的第n项（的具体项值）并输出。具体地说，可通过在基类baseCla及其派生类fib1Cla、fib2Cla和fib3Cla中说明如下的同一个虚函数“virtual double fib(int n) ”，来实现求Fibonacci数列第n项值并返回的3种不同求解方法。例如，可设计并使用已经在第4和第5章的练习中所实现的求解方法：简单变量“数据平移”法、使用数组的实现法以及使用递归函数的实现法。-The use of virtual
how_many_fibs
- Recall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n>=3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a,b]. -Recall the definition of the Fibonacci numbers:
fiboMain(2)
- fibonacci by recursive function
Lab7
- this the code to find Fibonacci number.-this is the code to find Fibonacci number.
Ocampos_02MO_1109
- algoritmic of golden search and fibonacci
fibonaci
- Fibonacci数列，已知一个Fibonacci数，能求出它的N值-Where Fibonacci sequence, a number of known where Fibonacci, can find its N
main
- 算法分析实验 算法分析 算法分析基础——Fibonacci序列问题-Experimental analysis of algorithms analysis of algorithms analysis of algorithms based- Fibonacci sequence problem
suanfa
- 算法的试验报告 包括斐波那契数列问题（内涵流程图等等）-Test report including algorithm Fibonacci sequence
2.3
- 求解Fibonacci数列的三种方法，一种用常规算法，一种用数组，一种用递归算法-Solving Fibonacci series three methods, a conventional method, an array, a recursive algorithm for
JAVA1_1
- 编写一个Java程序，用于输出Fibonacci数列的前20项。 提示：Fibonacci数列定义为:第一、二项的值为1，从第三项开始依次为前两项的和。 Fibonacci[0]=Fibonacci[1]=1 Fibonacci[i]=Fibonacci[i-2]+Fibonacci[i-1] (i>=2) -Write a Java program for Fibonacci series, the first output 20. Tip: Fibonacci sequence