C语言实现合并两个有序（从小到大）顺序表为一个顺序表

#include<stdio.h>
#include<malloc.h>

typedef int ElemType;
typedef int status;
# define LIST_INIT_SIZE 100
# define OK 1
# define OVERFLOW -1

typedef struct{
ElemType *elem;
int length;
int listsize;
} SqList;

//初始化线性表
status InitList_Sq(SqList *L){
L-> elem  = (ElemType *)malloc(LIST_INIT_SIZE * sizeof(ElemType)) ;
if(!L->elem) exit(OVERFLOW);
L->length = 0;
L->listsize = LIST_INIT_SIZE;

return OK;
}

//创建有序表并为其赋值
void Create_sq(SqList *L){
int i,n;
printf("创建一个有序表！\n");
printf("输入有序表里的元素个数：");
scanf("%d",&n);
L->length = n;
for(i=0;i < n;i++){
printf("输入第%d个元素的值：",i+1);
scanf("%d",&L->elem[i]);
printf("\n");
}
}

//打印有序表
void Disp_Sq(SqList L){
int i,n;
n = L.length;
for(i=0;i<n;i++){
printf("%5d",L.elem[i]);

}
printf("\n");
}

//合并有序表
void Combine(SqList *la,SqList lb){
int i = la->length - 1,j = lb.length - 1;

while(i >= 0 && j >= 0){
if(la->elem[i] <= lb.elem[j]){

if (!la->elem[i + 1])
{
la->elem[i + 1] = lb.elem[j];

}else{
for (int k = la->length - 1; k >= i+1; --k)
{
la->elem[k +1] = la->elem[k];
}
la->elem[i + 1] = lb.elem[j];
}
la->length++;
j--;

}else{
i--;
}
}
}

main(){
SqList sla;
SqList slb;
InitList_Sq(&sla);
InitList_Sq(&slb);

Create_sq(&sla);
Create_sq(&slb);

Combine(&sla,slb);
Disp_Sq(sla);
}