#include<iostream>
using namespace std;
template<class T>
void Insertionsort(T *a,int n)
{
int in,out;
for(out=1;out<n;++out)
{
T temp = a[out];
in = out;
while(in>0&&a[in-1]>=temp)
{
a[in] = a[in-1];
--in;
}
a[in] = temp;
}
}
int main()
{
int a[8] = {8,4,6,32,55,2,7,9};
Insertionsort(a,8);
for(int i=0;i<8;i++)
cout<<a[i]<<endl;
return 0;
}
using namespace std;
template<class T>
void Insertionsort(T *a,int n)
{
int in,out;
for(out=1;out<n;++out)
{
T temp = a[out];
in = out;
while(in>0&&a[in-1]>=temp)
{
a[in] = a[in-1];
--in;
}
a[in] = temp;
}
}
int main()
{
int a[8] = {8,4,6,32,55,2,7,9};
Insertionsort(a,8);
for(int i=0;i<8;i++)
cout<<a[i]<<endl;
return 0;
}