Program And Algorithm Bubble Sort

Algoritma :

 
Deklarasi:

i,j  = integer

data [ ]   = integer

Deskripsi:

for i <- 1 to n do
for j <- n to i do
if data[j]<data[j-1] then
tukar (j,j-1)
end if
end for
end for

end

Programnya Sbb:

 

#include <iostream.h>
#include <conio.h>

int data[10],data2[10];
int n;
void tukar(int x,int b){
int z;
z=data[b];
data[b]=data[x];
data[x]=z;
}
void bubble(){
for(int i=1;i<=n;i++){
for(int j=n;j>=i;j--){
if(data[j]<data[j-1])
tukar(j,j-1);}
}
}
int main(){
cout<<"Bubble Sort Program";
cout<<"\nInputkanBanyak data : ";
cin>>n;
for(int i=1;i<=n;i++){
cout<<"Data ke "<<i<<" : ";
cin>>data[i];
data2[i]=data[i];
}
bubble();
cout<<"Data setelah Dilakukan Penyeleksian : ";
for(int i=1; i<=n; i++){
cout<<" "<<data[i];
}
getch();
return 0;
}