斐波拉契数列专题
斐波拉契数列介绍
斐波那契数列（Fibonacci sequence），又称黄金分割数列、因数学家莱昂纳多·斐波那契（Leonardoda Fibonacci）以兔子繁殖为例子而引入，故又称为“兔子数列”，指的是这样一个数列：0、1、1、2、3、5、8、13、21、34、……在数学上，斐波那契数列以如下被以递推的方法定义：F(0)=0，F(1)=1, F(n)=F(n - 1)+F(n - 2)（n ≥ 2，n ∈ N*）在现代物理、准晶体结构、化学等领域，斐波纳契数列都有直接的应用
输出一定范围的斐波拉契数列
C实现
#include<stdio.h>
int main()
{
int i,n,t1 = 0,t2 = 1;
int nextTerm;
printf("你想输出几项：");
scanf("%d",&n) ;
printf("斐波拉契数列前%d项：",n);
for(i =1;i<=n;++i)
{
printf("%d,",t1);
nextTerm = t1+t2;
t1 = t2;
t2 = nextTerm;
}
return 0;
}
运行结果：
C++实现
#include<iostream>
using namespace std;
int main()
{
int i,n,t1 = 0,t2 = 1;
int nextTerm;
cout<<"你想输出几项:";
cin>>n;
cout<<"斐波拉契数列项:";
for(i =1;i<=n;++i)
{
cout<<t1<<",";
nextTerm = t1+t2;
t1 = t2;
t2 = nextTerm;
}
return 0;
system("pause" );
}
运行结果：
python实现
t1 = 0 ;
t2 = 1 ;
n = int(input("请问你想输出几项："))
print("斐波拉契数列：")
for i in range(n):
print(t1,",")
nextTem = t1+t2
t1 = t2
t2 = nextTem
运行结果：
输出小于某个数的斐波拉契数列
C实现
#include<stdio.h>
int main()
{
int t1 = 0,t2 = 1,nextTerm = 0,n;
printf("请输入一个整数：");
scanf("%d",&n);
printf("你要的小于%d的斐波拉契数列：%d,%d,",n,t1,t2);
nextTerm = t1+t2;
while(nextTerm <= n)
{
printf("%d,",nextTerm);
t1 = t2;
t2 = nextTerm;
nextTerm = t1+t2;
}
return 0;
}
运行结果：
C++实现
#include<iostream>
using namespace std;
int main()
{
int i,n,t1 = 0,t2 = 1;
int nextTerm;
cout<<"你想输出几项:";
cin>>n;
cout<<"斐波拉契数列项:";
for(i =1;i<=n;++i)
{
cout<<t1<<",";
nextTerm = t1+t2;
t1 = t2;
t2 = nextTerm;
}
return 0;
system("pause" );
}
运行结果：
python实现
#include<iostream>
using namespace std;
int main()
{
int t1 = 0,t2 = 1,nextTerm = 0,n;
cout<<"请输入一个整数：";
cin>>n;
cout<<"你要的小于"<<n<<"的斐波拉契数列:"<<t1<<","<<t2<<",";
nextTerm = t1+t2;
while(nextTerm <= n)
{
cout<<nextTerm<<",";
t1 = t2;
t2 = nextTerm;
nextTerm = t1+t2;
}
return 0;
system("pause");
}
运行结果：
三种语言都是特别好的语言，但是python真的好简洁，真的老少皆宜！