C语言中线性表的顺序实现

#include<stdio.h>
typedef struct SqList
{
    /* data */
    int data[50];
    int length;
}List;

void InitList(List *L,int number){
    L->length=0;
    int i,j=0;
    printf("Please input %d times: \n",number);
    for(i=0;i<number;i++){
        scanf("%d",&j);
        L->data[i]=j;
    }
    L->length = number;
} 
void printList(List *L){
    int i,j;
    j = L->length;
    for(i=0;i<j;i++){
        printf("%d  ",L->data[i]);
    }
    printf("\n");
}
void ListInsert(List *L,int place, int number){
    if(place>L->length){
        printf("Error, out of index\n");
    }
    else if (L->length==50)
    {
        printf("index has full\n");
    }
    else{
        int i;
        for(i=L->length;i>place;i--){
            L->data[i] = L->data[i-1];
        }
        L->data[i]=number;
        L->length++;
    }
}
void ListeDelete(List *L,int place){
    int i;
    for(i=place;i<L->length;i++){
        L->data[i-1]=L->data[i];
    }
    L->length--;
}


int main(){
    List list;
    InitList(&list,5);
    printList(&list);
    ListInsert(&list,3,7);
    printList(&list);
    ListeDelete(&list,4);
    printList(&list);
}