搜索资源列表
Fibonacci
- 该程序实现了对文件的输入输出读取操作，并用C语言实现了对于Fibonacci函数的数学计算
Fibonacci
- Fibonacci数的计算方法，包含多种思路的解答，对C++学习有帮助
fibonacci
- 计算Fibonacci数列,用户输入第N项，得到该项的数值-Calculate the Fibonacci series, users enter the N to obtain the numerical
fibonacci
- efective way to generate "fibonacci" without rekurency - generates numbers from fibonacci sequence - (natural numbers)-efective way to generate "fibonacci" without rekurency- generates numbers from fibonacci sequence- (natural numbers)
Fibonacci
- 取石子游戏之必胜策略 采用斐波那契数列作为算法-The winning strategy game to take stones used Fibonacci sequence as an algorithm
fibonacci
- The Fibonacci sequence written in C++. I used DevC to develop, compile and run the code. Project files are included.
Fibonacci
- 斐波那契数列1，1，2，3，5，8，13，21……的通项公式，其中a(n+2)= a(n+1)+an 注括号内为下标。-Fibonacci sequence 1,1,2,3,5,8,13,21 ... ... The general formula, where a (n+2) = a (n+1)+ an injection subscr ipt brackets.
Fibonacci
- 控制信息研究生学科中最优化方法中的Fibonacci算法的基本C程序，希望对大家有用-Control information, the most graduate student in the Fibonacci algorithm optimization basic C program, we hope to be useful
Fibonacci
- 斐波那契数列的演示程序，通过修改源码中m的值可以控制数列的长度-illustrate Fibonacci
Fibonacci-Sequence
- 利用递归算法计算斐波那契数列的n项的值，-Recursive algorithm to calculate the Fibonacci series, the value of n items
Fibonacci
- 最优化方法：斐波那契法求极值-Fibonacci method extremum
Fibonacci-sequence-
- 3. 利用虚函数手段，按照3种不同的计算方法来求出Fibonacci数列的第n项（的具体项值）并输出。-3 by means of virtual functions, n terms of the Fibonacci sequence (the specific items of value) and output is obtained in accordance with the different calculation methods.
Fibonacci-series
- 斐波那契数列 递归调用，主要用于了解递归用法-The Fibonacci series recursive calls, mainly used to understand recursion usage
Fibonacci-Method
- 斐波那契法（Fibonacci）求解单峰值函数极小值。 函数可以自己进行宏定义，本代码已经定义了一个简单的函数，用来测试其可行性。-The Fibonacci method for solving single peak function minimum. Function can define your own macros, the code defines a simple function to test its feasibility.
Fibonacci
- The fibonacci series in C
Dynamic-Fibonacci
- 动态规划计算斐波那契数（后一个数等于前面两个数的和）1，1，2，3，5，8，13，21，34，55，89，144…… -Dynamic programming computes Fibonacci numbers (after a number equal to the previous two numbers) 1,1,2,3,5,8,13,21,34,55,89,144 ......
Fibonacci
- Fibonacci数列(高精度算法） Input 有多行，每行代表一个正整数n（1 ≤ n ≤ 1001）。 Output 对每个输入，输出Fibonacci数列的第n项。-Fibonacci sequence (precision arithmetic)
fibonacci-Packing
- 斐波那契装箱问题：给出以连续的前N个斐波那契数为边长的正方形，需要把他们装在一个长方形中，不允许有任何空隙，然后输出矩形的大小和每个正方形的左上角坐标，任意一个即可-Fibonacci packing problem: given a continuous first N Fibonacci side length of the square, they need to be installed in a rectangle, not allowed to have any gaps, then
Fibonacci
- 采用矩阵法求斐波那契数列，求解fac(n) 100000，其中n为大于等于3的正整数-Matrix method to the Fibonacci sequence
fibonacci一维搜索法
- 利用fibonacci一维搜索法寻找最优值(Find optimum by deploying Fibonacci Linear Research.)