C++ 递归及非递归的方法求Fibonacci函数 作者是谭顺富写的就好了

/*
*文件功能:递归的方法求Fibonacci级数
*作者：姓名：谭顺富 学号：0531100821 电子邮件：tanshunfu@mail.gxu.cn
*谭顺富的博客：http://tanshunfu.blog.163.com/profile/edit/
*/

# include <iostream>
using namespace std;
inline double fib(double n);
int main()
{
double n;
cout << " Please input a number:" << endl;
cin >> n;//输入n
n = int(n);
if (n>0)//防止输入非法数据
cout << "the class of Fib onacci is: " << "fib (" << n<< ") = " << fib (n) << endl;
else cout << "you have put a wrong number: " << n << endl;
}

// fib 函数:
inline double fib(double n)
{
if(n>2) return fib(n - 1) + fib(n - 2);
else if (n = 2) return 1;
else if (n = 1) return 1;
}

/*