Question

need an algorithm for the Fibonacci sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,

Answer 1

which language?

Answer 2

portuguese or english

Answer 3

LOL.. Didnt meant that. Which computer language?

Sou portugues já agora

Answer 4

In c++ for example, it would be something like:

int i, l;
int j, k=1;
for (i=0; i<100; i++)
{
l = j + k;
cout << l;
j = k;
k = l; }}

Answer 5

pascal

Answer 6

Pascal:

program fibo;
var
result : longint;
num,i, error: integer;
strnum: string;

function fib(n : integer) : longint;
begin
if n <= 2 then fib := 1
else fib := fib(n-2) + fib(n-1);
end;

begin
if ParamCount = 0 then
begin
writeln('Enter integer:');
readln(strnum);
val(strnum,num,error);
end else
begin
val (ParamStr(1), num, error);
end;
for i := 1 to num do
begin
result:= fib(i);
writeln(i, ' : ', result);
end;

end.

Answer 7

thanks Dalvoron and Diogo