insertsort

#include <stdio.h>
#include <stdlib.h>
#define maxsize 10
typedef struct{
   int a[maxsize+1];
   int length;	
}sqlist;
void insertsort(sqlist*l){
	int i,j;
	for(i=2;i<l->length;i++){
		if(l->a[i]<l->a[i-1]){
			l->a[0]=l->a[i];
			for(j=i-1;l->a[j]>l->a[0];j--){
				l->a[j+1]=l->a[j]; 
			}
			l->a[j+1]=l->a[0];
		}
	}
}
int main(){
	int length,i;
	scanf("%d",&length);
	sqlist*l=(sqlist*)malloc(sizeof(sqlist));
	l->length=length;
	for(i=1;i<=length;++i){
		scanf("%d",&l->a[i]);
		
	}
    insertsort(l);
	for(i=1;i<=length;i++){
		printf("%d\n",l->a[i]);
	}
	return 0;
	
}