顺序表实现直接插入排序

/*
	Author:Albert Tesla Wizard
	Time:2020/11/22 10:24
*/
#include<bits/stdc++.h>
#define MAXSIZE 1000
using namespace std;
struct Sqlist
{
    int* elem;
    int length;
};
int create(Sqlist&L,int a[],int n)
{
    L.elem=new int[MAXSIZE];
    L.length=0;
    for(int i=1;i<=n;i++){L.elem[i]=a[i-1];L.length++;}
}
void print(Sqlist&L)
{
    for(int i=1;i<=L.length;i++)cout<<L.elem[i]<<" ";
    cout<<'\n';
}
void DirectInsertsort(Sqlist&L)
{
    int i,j;
    for(i=2;i<=L.length;i++)
    {
        if(L.elem[i]<L.elem[i-1])
        {
            L.elem[0]=L.elem[i];
            L.elem[i]=L.elem[i-1];
            for(j=i-2;L.elem[j]>L.elem[0];j--)L.elem[j+1]=L.elem[j];
            L.elem[j+1]=L.elem[0];
        }
    }
}
int main()
{
    int a[9]={3,1,2,5,4,7,9,8,6};
    Sqlist L;
    create(L,a,9);
    print(L);
    DirectInsertsort(L);
    print(L);
    return 0;
}