Fibonacci sequence by recursive algorithm fail

[MikeOShea]

Tail recursive version. Runs quick.
Example Run:
fibo(400)
28481229810848961175798893768146099561538008878230489098647719564596927140403232​3901

fibotail(I,J,N):=
BEGIN
if N>0 then
return fibotail(J,I+J,N-1);
else
return J;
end;
END;

fibo(N):=
BEGIN
return fibotail(0,1,N);
END;