当前位置：
首页 资源下载
搜索资源 - the Fibonacci series
搜索资源列表
-
0下载：
该程序是一个有关fibonacci数列的打印问题
其中的一个功能是能修改生长周期
虽然很简单但不是每个人都会做的哟-that the procedure was a Fibonacci series, the printing problem which is a function of the growth cycle would amend Although very simple but not everyone will do yo
-
-
0下载：
验证Fibonacci数列与黄金分割的关系-certification Fibonacci series and the relationship between 0.618
-
-
0下载：
Fibonacci数列是一种特殊的数列，数列的第一项、第二项的值为1，从数列的第三项开始，每一项的值都等于数列前两项值的和。本题就是编程求解Fibonacci数列第n项的值，并在屏幕上显示出来。-Fibonacci series is a special series, the first series of items, the second of the value of a, series from the third, each have a value equal to the ser
-
-
0下载：
数据结构的生成Fibonacci数列和下三角的例子-data structure formation and the Fibonacci series of examples under 1.30
-
-
0下载：
此程序实现了利用矩阵连乘方法求fibonacci数列，文档里面包含我的求解思路-This program implements the use of matrix multiplication method for solving even the fibonacci series
-
-
0下载：
计算Fibonacci数列,用户输入第N项，得到该项的数值-Calculate the Fibonacci series, users enter the N to obtain the numerical
-
-
0下载：
用递归算法设计实现的斐波那锲数列，有些地方可能不太完善-Design and Implementation of recursive algorithm using the Fibonacci series Qie, some places may not be perfect
-
-
0下载：
使用如下所谓的简单变量“数据平移”方法来求出Fibonacci数列的第n项（的具体项值）并显示在屏幕上（正整数n通过键盘输入）：说明变量old1=1，old2=1，newItem；新的Fibonacci项newItem总是“距它最近”的前两项（old1与old2）的累加和。而后通过“old1=old2 old2=newItem ”进行所谓的“数据平移”。接着计算另一个新的Fibonacci项newItem，依次循环，直到求出数列的第n项时为止。-Use the following so-call
-
-
0下载：
本程序用来计算Fibonacci数列中任意一个位置的Fibonacci数-This procedure used to calculate the Fibonacci series in an arbitrary location Fibonacci number
-
-
0下载：
fibonacci series generation
-
-
0下载：
编写一个Java程序，用于输出并显示出Fibonacci数列的前20项。-Write a Java program for the output and demonstrate the Fibonacci series, the first 20.
-
-
0下载：
用3种不同的计算方法求Fibonacci数列的第n项，c++语言编写-With 3 different calculation method, to calculate Fibonacci series, the first n items, c++ language
-
-
0下载：
The fibonacci series is one of the most important series ever found. This series have introduces many new concepts and ideas. Asked to every student to amplify the ideology of coders, this code provides optimum solution to the series.
-
-
0下载：
利用递归算法计算斐波那契数列的n项的值，-Recursive algorithm to calculate the Fibonacci series, the value of n items
-
-
0下载：
本个小程序可实现斐波那契数列的计算，简短而精炼。-This small program can achieve the calculation of the Fibonacci series, a brief and concise.
-
-
0下载：
（1）编写一个矩阵操作类库，具体实现要求如下：
实现构造函数动态创建不同大小的二维矩阵m*n
实现函数完成两个矩阵的相加、求差与矩阵各个元素相乘运算；
实现函数可以得到矩阵中指定元素数值。
（2）Fibonacci数列是一个自然数数列，第1项和第2项均为1，从第3项开始,F(n)= F(n-1)+ F(n-2).定义一个数组，前两个元素初始化为Fibonacci数列的第1,2项，求出数列的前20项。-(1) the preparation of a matrix operati
-
-
0下载：
斐波那契数列 递归调用，主要用于了解递归用法-The Fibonacci series recursive calls, mainly used to understand recursion usage
-
-
0下载：
The fibonacci series in C
-
-
0下载：
The Fibonacci sequence is a series where the next term is the sum of pervious two terms. The first two terms of the Fibonacci sequence is 0 followed by 1.
-
-
0下载：
这个程序的作用是由用户输入一个值作为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.)
-
