Insertion Sort

Coding Program Insertion Sort :

#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--;
}
data[j+1]=temp;
}
}
int main()
{
cout<<"PROGRAM INSERTION SORT"<<endl;
cout<<"----------------------"<<endl;
cout<<"Masukkan Jumlah Data: ";
cin>>n;
cout<<"-----------------------\n";
for(int i=1;i<=n;i++)
{
cout<<"Masukkan data ke "<<i<<" : ";
cin>>data[i];
data2[i]=data[i];
}
insertion_sort();
cout<<"____________________\n";
cout<<"Data setelah di sort: ";
for(int j=1;j<=n;j++)
{
cout<<" "<<data[j];
}
return 0;
}