递归和迭代求斐波那契数列(举例)

递归法:

#includelong long  fib(int);int main(){    printf("the value is %lld\n",fib(100));    return 1;}long long fib(int n){    if(n==1||n==0)return 1;    else    return (fib(n-1)+fib(n-2));}

迭代法:

#include#define N 100long long fun( int);int main(){    printf("the value is %lld\n",fun(50));    return 1;} long long  fun(int n){    long i;    long long Fib[N];    Fib[0]=1;Fib[1]=1;    for(i=2;i<=n;i++)    Fib[i]=Fib[i-1] + Fib[i-2];    return Fib[n];}