#include<iostream>
using namespace std;
void InsertionSort(int a[], int n){
int j,p;
int temp;
for (p=1;p<n;p++)
{
temp = a[p];
for (j=p;j>0&&a[j-1]>temp;j--)
{
a[j]=a[j-1];
}
a[j]=temp;
}
}
void main(){
int a[6]={34,8,64,51,32,21};
InsertionSort(a, 6);
}
using namespace std;
void InsertionSort(int a[], int n){
int j,p;
int temp;
for (p=1;p<n;p++)
{
temp = a[p];
for (j=p;j>0&&a[j-1]>temp;j--)
{
a[j]=a[j-1];
}
a[j]=temp;
}
}
void main(){
int a[6]={34,8,64,51,32,21};
InsertionSort(a, 6);
}