递归法求第n个斐波那契数:#include<iostream>
using namespace std;int Fib_num(int n,int p,int q); int main() { int n; cin>>n; while(n) { int m=Fib_num(n,1,1);//函数调用 cout<<"第 "<<n<<" 个斐波那契数是:"<<m<<endl; cin>>n; } return 0; }
int Fib_num(int n,int p,int q)//递归函数 { if(n==1||n==2) return p; if(n>2) return Fib_num(n-1,1,1)+Fib_num(n-2,1,1); if(n<1) { throw exception("enter error !");//抛出异常 return 0; } }