搜索资源列表
Fibonacci
- 该程序实现了对文件的输入输出读取操作,并用C语言实现了对于Fibonacci函数的数学计算
Fibonacci
- Fibonacci数的计算方法,包含多种思路的解答,对C++学习有帮助
Fibonacci
- 计算 Fibonacci数 本程序特点 不受机器寄存器字长的限制,通过一个8为寄存器,通过修改RESULTS和TEMP的存储空间长度,用外存模拟内存计算,以达到计算任意阶Fibonacci数的目的
Fibonacci
- 用Fibonacci查找法查找所需内容
Fibonacci
- 计算经典的Fibonacci数列的代码,希望对大家有用
Fibonacci函数
- Fibonacci函数-Fibonacci function
fibonacci
- 【fibonacci運\算 用Dev-C++編譯】 學習,把學習到的東西以C語言的方式實現。
MIPS汇编 fibonacci数列
- 一个求fibonacci数列的程序
program of the Fibonacci Numbers
- program of the Fibonacci Numbers
FIBONACCI利用动态规划方法实现求解斐波那契序列
- 利用动态规划方法实现求解斐波那契序列,利用数组存储重复使用的中间结果,提供程序运行的效率-Using dynamic programming method to solve the Fibonacci sequence
fibonacci
- 此程序实现了利用矩阵连乘方法求fibonacci数列,文档里面包含我的求解思路-This program implements the use of matrix multiplication method for solving even the fibonacci series
Fibonacci_number
- 输入n,输出费波那契数列 1~n 项 Input a number n and then output Fibonacci numbers from the first to the nth Fibonacci_number2: 输入 n ,输出第 n 项 Input n and then output the nth number -Input a number n and then output Fibonacci numbers from the first to the
fibonacci
- In mathematics, the Fibonacci sequence is the following infinite sequence of natural numbers: The first element is 0, the second is 1 and each remaining element is the sum of the previous two: Each element of this sequence is called F
matlab-procedure
- 0.618法、Fibonacci法、抛物线法最优化方法编程,并给出了具体的实例,详细的源程序-0.618 method, Fibonacci method, the parabolic law programming optimization method, and gives specific examples and detailed source
fibonacci
- 计算Fibonacci数列,用户输入第N项,得到该项的数值-Calculate the Fibonacci series, users enter the N to obtain the numerical
fibnum
- 这个程序是一个Win32程序,计算Fibonacci斐波纳契数列(一种整数数列, 其中每数等于前面两数之和)。其定义是f(1) = 1,f(2) = 2,并且当n>2时, f(n) = f(n-1) + f(n-2)。源代码种给出了三种计算方法。第一种方法用递归,第二种方法用大数组,第三种方法用小数组。此外,这个程序还具备多线程特性,所以在运算时可以做其它操作。代码用到了以前创建的Win32类。测试为发现bug和内存溢出。--Calculate Fibonacci value.
code
- 一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with th
fbnq
- 已知斐波那契数列的定义:F(1)=1,F(2)=1,F(i)= F(i-1)+ F(i-2) (i>=3),编写求该数列前n项的子程序 实现了输入一个数,然后将计算的结果保存在存储器中-Known Fibonacci sequence definition: F (1) = 1, F (2) = 1, F (i) = F (i-1)+ F (i-2) (i> = 3), preparation for the series before the n of the subrout
linear_optimization
- 用0.618法和Fibonacci法求解函数最小值-With 0.618 and the minimum function Fibonacci method
Fibonacci
- 斐波那契数列,包含头文件、算法实现文件及主函数文件。 -Fibonacci sequence, including the header files, the algorithm to achieve the main function of documents and files.