不好的递归算法

#include


typedef unsigned int UINT;


long int Fib(int);


int main(void)
{
long int foo;
foo = Fib(45);
printf("the num is : %d\n",foo);
return 0;
}


long int Fib(int N)
{
if(N <= 1)
return 1;
else
return Fib(N - 1) +Fib(N -2);
}