Algoritmanya:
Deklarasi:
temp,k :integer;
Dekripsi:
For i := 2 to jmldata do
Temp :=data[i];
j := i-1;
end for
while (data[j] > temp) and (j>0) do
data[j+1] := data[j];
dec(j);
end while;
data[j+1]:=temp;
end;
Source Codenya:
#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_sort(){
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--; }
#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_sort(){
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;
}}
void main(){
//Proses Input Data
cout<<"Masukkan Jumlah Data : ";
cin>>n;
for(int i=1;i<=n;i++)
{
cout<<"Masukkan data ke "<<i<<" : ";
cin>>data[i];
data2[i]=data[i];
}
insertion_sort();
cout<<"\n\nData Setelah di Sort : ";
for(int i=1; i<=n; i++) {
cout<<" "<<data[i];}
cout<<"\n\nSorting Selesai";
getch();
}
0 Komentar