Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- program ntifib;
- //n-ti clan fibonacijevog niza
- var n,f,br:integer;
- function fib1(n:integer):integer;
- //nerekurzivna funkcija
- var a,b,c,i:integer;
- begin
- a:=1;
- b:=1;
- c:=1;
- while(n>2)do
- begin
- c:=a+b;
- n:=n-1;
- a:=b;
- b:=c;
- end;
- fib1:=c;
- end;
- function fib2(n:integer):integer;
- //rekurzivno
- begin
- br:=br+1;
- if(n>2) then fib2:=fib2(n-1)+fib2(n-2)
- else fib2:=1;
- end;
- begin
- write('Clan koji se trazi: ');
- readln(n);
- writeln(n,'. clan je ', fib1(n));
- writeln(n,'. clan je ', fib2(n));
- writeln(br);
- readln;
- end.
Add Comment
Please, Sign In to add comment