"CONTOH SELECTION 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 selection_sort()
{  int pos,i,j;
for(i=1;i<=n-1;i++)
{   pos = i;
for(j = i+1;j<=n;j++)
{
if(data[j] < data[pos]) pos = j;
}   if(pos != i) tukar(pos,i);
}
}
void main()
{
cout<<"\t\t\t**PROGRAM SELECTION SORT**"<<endl;
//Input Data
cout<<"\nMasukkan Jumlah Data:";
cin>>n;
for(int i=1;i<=n;i++)
{
cout<<"\nMasukkan data ke "<<i<<":";
cin>>data[i];
data2[i]=data[i];
}
selection_sort();
cout<<"\n\n";
//tampilkan data
cout<<"Data Setelah di Sort:";
for(int i=1; i<=n; i++)
{
cout<<""<<data[i];
}
cout<<"\n\nSorting Selesai";
getch();
}

Hasilnya:

"CONTOH 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;
}
}
void main()
{
cout<<"\t\t\t**PROGRAM INSERTION SORT**"<<endl;
//input Data
cout<<"\nMasukkan Jumlah Data :";
cin>>n;
for(int i=1;i<=n;i++)
{
cout<<"\nMasukkan data ke "<<i<<":";
cin>>data[i];
data2[i]=data[i];
}
insertion_sort();
cout<<"\n\n";
//tampilkan data
cout<<"Data Setelah di Sort : ";
for(int i=1; i<=n; i++)
{
cout<<""<<data[i];
}
cout<<"\n\nSorting Selesai";
getch();
}

Hasilnya: