順序表的基本操作 C語言

#include<stdio.h>
#include<stdlib.h>
#define MaxSize 10
typedef int ElementType;
struct SqList {
    ElementType elem[MaxSize];
    int Length;
};
typedef struct  SqList *PtrNode;
typedef PtrNode List;
List InitList() {  //初始化
    List L;
    L = (List)malloc(sizeof(struct SqList));
    L->Length = 0;
    printf("初始化成功\n");
    return L;
}
//插入
int InSert(List L, int i, ElementType x) { 
    int j;
    if (i<1 || i>L->Length + 1) {
        printf("越界"); return 0;
    }
    for (j = L->Length; j > i; j--) {
        L->elem[j + 1] = L->elem[j];
    }
    L->elem[i - 1] = x;  //第i處，因為是數組所以減一
    L->Length++;
    return 1;
}
//刪除
int Delete(List L, int i) {
    int j;
    if (i<1 || i>L->Length) {
        printf("越界"); return 0;
    }
    for (j = i - 1; j < L->Length-1; j++)
        L->elem[j] = L->elem[j+1];
    L->Length--;
    return 1;

}
//查找第i處的數據
int GetElem(List L, int i) {
    if (i<1 || i>L->Length) {
        printf("越界"); return 0;
    }
    return L->elem[i - 1];
}
//遍歷輸出
int Print(List L) {
    int i = 0;
    for (i; i < L->Length; i++)
        printf("%d\n", L->elem[i]);
}
int main() {
    int a,b;
    ElementType x;
    List list;
    list=InitList();
    InSert(list, 1, 1);
    InSert(list, 2, 2);
    InSert(list, 3, 3);
    Print(list);
    printf("第一處的元素為:%d\n",GetElem(list,1));
    printf("要刪除第幾處的數據");
    scanf("%d", &a);
    Delete(list, a);
    Print(list);
}