顺序表-直接插入排序

#include<bits/stdc++.h>
#define MAX 100
typedef struct{
    int *Elem;
    int length;
}SqList;
void Creat(SqList &s){
    s.Elem = (int*)malloc(MAX*(sizeof(int)));
    if(!s.Elem){
        printf("创建失败\n"); exit(1);
    }
    int n;
    printf("请输入n以-1结束：\n");
    scanf("%d",&n);
    s.length = 1;
    while(n!=-1){
        s.Elem[s.length++] = n;
        scanf("%d",&n);
    }
}
//直接插入排序 
void InserSort(SqList &s)
{
    int i,j;
    for(i=2;i<s.length;i++){
        s.Elem[0] = s.Elem[i];
        for(j=i-1;s.Elem[0]<s.Elem[j];j--){
            s.Elem[j+1] = s.Elem[j];
        }
        s.Elem[j+1] = s.Elem[0];
    } 
}
//输出顺序表
void print(SqList s){
    int i;
    for(i=1;i<s.length;i++){
        printf("%d ",s.Elem[i]);
    }
} 
int main(){
    SqList s;
    Creat(s);
    InserSort(s);
    print(s);
    return 0;
}