[solved] – Question 86644

Implement the basic recursive implementation of Fibonacci number function and find the largest Fibonacci number that your computer can compute. The algorithm is as follows:
int Fib(int n)
{
 if(n<2) return n;
 return Fib(n-1) + Fib(n-2);
}

Expert Answer

---