代码搜索：Fibonacci
找到约 1,377 项符合「Fibonacci」的源代码
代码结果 1,377
www.eeworm.com/read/436253/7254333
fibonacciǰ20
#include
void main()
{
long int f1,f2;
int i;
f1=1,f2=1;
for(i=1;i
www.eeworm.com/read/390183/8480284
pm fibonacci.pm
package Heap071::Fibonacci;
use strict;
use vars qw($VERSION @ISA @EXPORT @EXPORT_OK);
require Exporter;
require AutoLoader;
@ISA = qw(Exporter AutoLoader);
# No names exported.
# No na
www.eeworm.com/read/432739/8577145
m fibonacci.m
function yiweishousuo=fibonacci(e)
%a is the left port of area
%b is the right port of area
%e is the precision
tic %程序运行时间
[a,b]=areafind(0,1,2);
%creat the fabonacci 数列
c=(b-a)/e;
www.eeworm.com/read/432739/8577146
asv fibonacci.asv
function yiweishousuo=fibonacci(e)
%a is the left port of area
%b is the right port of area
%e is the precision
tic %程序运行时间
[a,b]=areafind(0,1,2);
%creat the fabonacci 数列
c=(b-a)/e;
www.eeworm.com/read/286908/8737813
c fibonacci.c
/*---------------------------------------------------------------------------
* fibonacci transformation
* ---------------------------------------------------------------------------*/
#include
www.eeworm.com/read/286908/8737992
c~ fibonacci.c~
/*---------------------------------------------------------------------------
* Arnold transformation
* ---------------------------------------------------------------------------*/
#include
www.eeworm.com/read/430096/8766378
java fibonacci.java
// control/Fibonacci.java
// TIJ4 Chapter Control, Exercise 9, page 153
/* A Fibonacci sequence is the sequence of numbers 1, 1, 2, 3, 5, 8, 13, 21, 34,
* and so on, where each number (from the thi
www.eeworm.com/read/284429/8930729
m fibonacci.m
% name 曾莉莉
% id 07120482
% email 07120482@bjtu.edu.cn
% supervisor 丁晓明
function f=fibonacci(n)
% FIBONACCI Fibonacci sequence
% f=FIBONCCI(n) generates the first n Fiboncci numbers.
f=zer
www.eeworm.com/read/427511/8938543
m fibonacci.m
function f = fibonacci(n)
%FIBONACCI Fibonacci sequence
% f = FIBONACCI(n) generates the first n Fibonacci numbers.
f = zeros(n,1);
f(1) = 1;
f(2) = 2;
for k = 3:n
f(k) = f(k-1) + f(k-2);
www.eeworm.com/read/186068/8963042
cpp fibonacci.cpp
#include
using namespace std;
/*main information*/
void info()
{
cout