main.cpp

用递归算法设计实现的斐波那锲数列

#include<iostream>
using namespace std;

template <class T>
float Fei(T a[],T n)
{
	//for(int i=0;i<n;i++)
	//{
	if(n==1)
	return a[0];
	else if(n==2)
		return a[1];
	else 
		return Fei(a,n-1)+Fei(a,n-2);
//	}
//	return Fei(a,n-1)+Fei(a,n-2);
}

template <class T>
T Pan(T n)
{
	if(n<3)
	{
		cout<<"The data must large than 2!!Enter the data again!!"<<endl;
		cin>>n;
		Pan(n);
	}
	cout<<"The data is OK!!"<<endl;
	return n;
}


void main()
{
	int n;
	cout<<"Enter the array's number:"<<endl;
	cin>>n;
	Pan(n);
	int *a=new int[n];/////此处的n不能接受Pan(n)中的返回值？？？？？？？
	cout<<"Enter the first and second datas:"<<endl;
		cin>>a[0]>>a[1];
	cout<<Fei(a,n);
	cout<<endl;
}