Algorithm for Fibonacci using Recursion

Algorithm fnFibo(n)
{
if(n==0 || n==1)
return n;
else
return (fnFibo(n-2)+fnFibo(n-1));
}

Algorithm fnFibo(n)

{

if(n==0 || n==1)

return n;

else

return (fnFibo(n-2)+fnFibo(n-1));

}