RaArt
Minggu, 21 Juni 2015
Array
program fibboacci;
uses wincrt;
label awal;
const max=50;
var
p:integer;
procedure fibbonacci_iterasi;
var
f:array[1..max]of integer;
n:integer;
i:integer;
begin
f[1]:=1;
f[2]:=1;
write('cetak bilangan fibbonacci sampai suku ke:'); readln(n);
writeln;
writeln('Bilangan fibbonacci sampai suku k',n,'sbb:');
write(f[1],'');
write(f[2],'');
for i:=3 to n do
begin
f[i]:=f[i-1]+f[i-2];
write(f[i],'');
end;
writeln;
writeln;
writeln('suku ke',i,':',f[i])
end;
procedure fibbonacci_rekursif;
var
f:array [1..50]of integer;
x:integer;
i:integer;
function fibo(n:integer):integer;
begin
if(n=1)or(n=2)then fibo:=1
else
fibo:=fibo(n-1)+fibo(n-2)
end;
begin
write('cetak bilangan fibbonacci sampai suku ke:');
readln(x);
writeln;
for i:=1 to x do
begin
f[i]:=fibo(i);
write(f[i],'');
end;
writeln;
writeln('suku ke',i,':',f[i]);
end;
procedure bilangan_prima;
var
i,j,m,n,batas,jml:integer;
prima:boolean;
prim:array[1..100]of integer;
begin
write('bilangan prima sampai suku ke:');readln(n);
writeln('sebagai berikut:');
i:=3;
prim[1]:=2;
prim[2]:=3;
m:=2;
repeat
i:=i+1;
batas:=round(sqrt(i))+1;
prima:=true;
if prima=true then
begin
m:=m+1;
prim[m]:=i;
end;
until m=n;
for i:=1 to n do
begin
write(prim[i],'');
jml:=jml+prim[i];
end;
writeln;
writeln('jumlah bilangan prima:',jml);
readln;
end;
begin
awal:
clrscr;
gotoxy(15,1);writeln(' PROGRAM FIBBONACCI ');
gotoxy(15,2);writeln('~~~~~~~~~~~~~~~~~~~~~~~~~~~~~');
writeln;
writeln('1.pilihan anda:');
writeln;
writeln('1. Fibbonacci iterasi');
writeln('2. Fibbacci Rekursif');
writeln('3. Bilangan Prima');
writeln;
write('Anda memilih no?');readln(p);
writeln('_________________________');
writeln;
case p of
1:begin
fibbonacci_iterasi;
writeln('ingin mengulang? (press enter please)');
readkey;
goto awal;
end;
2:begin
Fibbonacci_rekursif;
writeln('ingin mengulang?(press enter please)');
readkey;
goto awal;
end;
3:begin
Bilangan_prima;
writeln('ingin mengulang?(press enter please)');
readkey;
goto awal;
end;
end;
end.
Langganan:
Postingan (Atom)