斐波那契数列数列计算

题目：试用模板函数编写计算斐波那契数列的递归函数和非递归函数。

#include<iostream>
#include <iomanip>
using namespace std;
template <class T>
 void Fibo_nonRecursive(T n)
{
int i;
int Fibo[100]= { 1, 1 };
if ((n ==1) || (n == 2))
cout << "1"<< endl;
else if ((n>2)&&(n <= 100))
{
cout << "1" << endl;
cout << "1" << endl;
for (i = 2; i < n; i++)
{
Fibo[i] = Fibo[i-1] + Fibo[i - 2];
cout << Fibo[i] << endl;
}
}
else
cout << "Please make the n less than 100" << endl;
}
template <class T>
int  Fibo_Recursive(T n)
{

if (n == 1)
return n;
else if (n == 2)
return (n - 1);
if ((n>2) && (n<=100))
return ((Fibo_Recursive(n - 1) + Fibo_Recursive(n - 2))); 
else return 0;
}
int main()
{
int n;
cout << "Please input the number(n<=100): \n";
cin >> n;
if (n > 100)
{
cout << "You'd better input a number less than 100!" << endl;
}
cout << "The non-recursive way is: \n" << endl;
Fibo_nonRecursive(n);
cout << "The recursive way is :" << endl;
for (int i = 0; i < n; i++)
{
int m[100] = { 1,1 };
m[i] = Fibo_Recursive(i+1);
cout << m[i] << endl;
}
return 0;
}