program Pengurutan_sorting;
uses wincrt;
var i,n,j,s : integer;
a: array [1..100] of integer;
procedure buble;
var z: integer;
begin
for i:= 1 to n-1 do
begin
for j:= n downto i+1 do
begin
if a[j] < a[j-1] then
begin
z:= a[j];
a[j]:= a[j-1];
a[j-1]:=z;
end;
end;
end;
end;
function cari1(xx : integer): integer;
var i : integer;
begin
i := 1;
while ((i<n) and (a[i] <> xx)) do
i:=i+1;
if a[i] = xx then
cari1:=i
else
cari1:=0;
end;
begin
writeln('***This is Program Searching & Sorthing ***');
writeln;
write('masukkan banyak Input Data : '); readln(n);
for i:= 1 to n do
begin
write('Data[',i,'] : '); readln(a[i]);
end;
buble;
write('Data setelah diurutkan : ');
for j:=1 to n do
write (a[j],' ');
writeln;
write('Nilai yang dicari = '); readln(a[j]);
a[i]:=cari1(a[j]);
if a[i] <> 0 then
write(a[j],' ditemukan pada indeks ke-',a[i])
else
write(a[j],' tidak ditemukan');
writeln;end.
Tidak ada komentar:
Posting Komentar