Pascal: Recursive Solution to Fibonacci Sequence

program recursive_fibonacci;

uses SysUtils;

var f1, f2, i, nextfib, limit : integer;
gr : single;

function fib (limit:integer):integer;
begin
 if (limit=0) or (limit=1) then fib:=limit
 else fib:=fib(limit-1)+fib(limit-2);
end;

begin
 writeln ('Fibonacci numbers and Golden Ratio:');
 writeln ('Enter fib number');
 readln(limit);
 writeln(fib(limit));
 readln;
end.

Back to questions