#include <iostream>
#include <stdlib.h>
using namespace std;
typedef struct
{
int *r;
int length;
}SqList;
SqList* InitSqList(int N)
{
SqList *L = (SqList*)malloc(sizeof(SqList));
L->r = (int*)malloc(sizeof(int)*(N+1));
for(int i=1;i<=N;i++)
{
//L->r[i] = 0;
cin>>L->r[i];
}
L->length = N;
return L;
}
//直接插入排序
void InsertSort(SqList *L)
{
int i,j;
for(i=2;i<=L->length;i++)
{
if(L->r[i]<L->r[i-1])
{
L->r[0] = L->r[i];
for(j=i-1;L->r[j]>L->r[0];j--)
{
L->r[j+1] = L->r[j];
}
L->r[j+1] = L->r[0];
}
}
}
int main()
{
SqList *L = InitSqList(5);
InsertSort(L);
for(int i=1;i<=5;i++)
{
cout<<L->r[i]<<" ";
}
return 0;
}