Program Pengurutan Data Dengan Buble Sort
0 likes194 views
The document describes a Bubble_Sort program that takes user input for the number of data values, randomly generates data and stores it in two arrays, sorts one array in ascending order and the other in descending order using bubble sort, and outputs the sorted arrays. It initializes variables, generates random data for two arrays, uses nested for loops to compare and swap elements to sort the arrays in ascending and descending order, and prints the sorted arrays.
![Program Buble_Sort;
USES Crt;
VAR
n, i, j,x, y : integer;
data,Data1,data2 : Array [1..50] of integer ;
BEGIN
clrscr;
randomize;
Write ('Masukkan banyak data : '); Readln (n);writeln;
write('Data Masukan : ');
For i:= 1 to n do
BEGIN
Data1[i]:=random(100);
Data2[i]:=data1[i];
Write(' ', Data1[i]);
End;
{Proses Mengurutkan Data Ascending}
For i:= 1 to n do
Begin
For j:= n downto i do
If Data1[i]>Data1[j] then
Begin
x:=Data1[i];
Data1[i]:=Data1[j];
Data1[j]:=x;
End;
End;
Writeln;
{Proses Mengurutkan Data Descending}
For i:= 1 to n do
Begin
For j:= n downto i do
If Data2[i]<Data2[j] then
Begin
y:=Data2[i]; {Simpan Data ke-i sbg bil Terkecil}
Data2[i]:=Data2[j]; {Tukar posisi Data}
Data2[j]:=y;
End;
End;
{Cetak Hasil Urutan Data Descending}
write('Data Ascending : ');
For i:= 1 to n do
Write(' ', Data1[i]);
writeln;
{Cetak Hasil Urutan Data Ascending}
write('Data Descending : ');
For i:= 1 to n do
Write (' ', Data2[i]);
readln;
END.](https://image.slidesharecdn.com/programpengurutandatadenganbublesort1-150530021647-lva1-app6892/85/Program-Pengurutan-Data-Dengan-Buble-Sort-1-320.jpg)
Program Pengurutan Data Dengan Buble Sort
- 1. Program Buble_Sort; USES Crt; VAR n, i, j,x, y : integer; data,Data1,data2 : Array [1..50] of integer ; BEGIN clrscr; randomize; Write ('Masukkan banyak data : '); Readln (n);writeln; write('Data Masukan : '); For i:= 1 to n do BEGIN Data1[i]:=random(100); Data2[i]:=data1[i]; Write(' ', Data1[i]); End; {Proses Mengurutkan Data Ascending} For i:= 1 to n do Begin For j:= n downto i do If Data1[i]>Data1[j] then Begin x:=Data1[i]; Data1[i]:=Data1[j]; Data1[j]:=x; End; End; Writeln; {Proses Mengurutkan Data Descending} For i:= 1 to n do Begin For j:= n downto i do If Data2[i]<Data2[j] then Begin y:=Data2[i]; {Simpan Data ke-i sbg bil Terkecil} Data2[i]:=Data2[j]; {Tukar posisi Data} Data2[j]:=y; End; End; {Cetak Hasil Urutan Data Descending} write('Data Ascending : '); For i:= 1 to n do Write(' ', Data1[i]); writeln; {Cetak Hasil Urutan Data Ascending} write('Data Descending : '); For i:= 1 to n do Write (' ', Data2[i]); readln; END.