// Demonstrates recursion using the Fibonacci series.
// demonstrates recursion
// Fibonacci find.
// Finds the nth Fibonacci number
// Uses this algorithm: Fib(n) = fib(n-1) + fib(n-2)
// Stop conditions: n = 2 || n = 1
#include <iostream.h>
int fib(int n);
int main()
{
int n, answer;
cout << "Enter number to find: ";
cin >> n;
cout << "\n\n";
answer = fib(n);
cout << answer << " is the " << n << "th Fibonacci
number\n";
return 0;
}
int fib (int n)
{
cout << "Processing fib(" << n << ")... ";
if (n < 3 )
{
cout << "Return 1!\n";
return (1);
}
else
{
cout << "Call fib(" << n-2 << ") and fib(" << n-1 <.\n";
return( fib(n-2) + fib(n-1));
}
}