Algoritma dan Program Insertion Sort

Posted in
Algoritma :
Deklarasi
    i,j          : integer
    temp     : integer
    data[]    : integer
Deskripsi
        for i <- 1 to n do
             temp <- data[i]
             j <- i-1
            while (data[j]>temp dan j>=0 )
                data[j+1] <- data[j]
                data[j+1] <- temp
            end while
         endfor
    end

Program :
#include <iostream.h>
#include <conio.h>
int data[10],data2[10];
int n;
void tukar(int a, int b){
int t;
t=data[b];
data[b]=data[a];
data[a]=t;}
void insertion(){
int temp,i,j;
for(i=1;i<=n;i++){
temp = data[i];
j = i -1;
while(data[j]>temp && j>=0){
data[j+1] = data[j];
j--;}
data[j+1] = temp;}}
int main(){
cout<<"Insertion Sort";
cout<<"\nBanyak data : ";
cin>>n;
for(int i=1;i<=n;i++){
cout<<"Data ke-"<<i<<" : ";
cin>>data[i];
data2[i]=data[i];}
insertion();
cout<<"Data setelah di sort : ";
for(int i=1; i<=n; i++){
cout<<" "<<data[i];}
getch();
return 0;}
0 comments