Zero?
One?
Return N
Else Recurse Fib
Minus One Plus Minus Two
This solution is the one most commonly given
unsigned long fib(unsigned int n)
{
if (n == 0 || n == 1)
{
return n;
}
else
{
return fib(n - 1) + fib(n - 2);
}
}