顺序表学习2---归并

#include<stdlib.h>
#include<stdio.h> 
#define LIST_INIT_SIZE     100
#define LISTINCREMENT  10 
#define OVERFLOW -2
#define OK 1 
#define ERROR 0  
typedef int ElemType;
typedef int Status;
typedef  struct {
	ElemType* elem;      
	int      length;      
	int      listsize;     
}SqList;
Status InitList_Sq(SqList* L);
Status ListInsert_Sq(SqList* L, int i, ElemType e);
Status visit_SqList(SqList L);
void MergeList_Sq(SqList La, SqList Lb, SqList* Lc);
void CreatList_Sq(SqList* L);

int main() {
	SqList La, Lb, Lc;

	InitList_Sq(&La); //初始化顺序表La 
	InitList_Sq(&Lb); //初始化顺序表Lb

	printf("创建顺序表La:\n");
	CreatList_Sq(&La);

	printf("创建顺序表Lb:\n");
	CreatList_Sq(&Lb);

	printf("顺序表La中数据元素分别是：\n");
	visit_SqList(La);

	printf("顺序表Lb中数据元素分别是：\n");
	visit_SqList(Lb);

	MergeList_Sq(La, Lb, &Lc);	//归并顺序表La,Lb中元素到Lc中

	printf("顺序表Lc中数据元素分别是：\n");
	visit_SqList(Lc);

	return 0;
}
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;
}
Status ListInsert_Sq(SqList* L, int i, ElemType e) {
	ElemType* newbase, * p, * q;
	if (i<1 || i>L->length + 1) return ERROR;
	if (L->length >= L->listsize) { 
		newbase = (ElemType*)realloc(L->elem, (L->listsize + LISTINCREMENT) * sizeof(ElemType));
		if (!newbase) exit(OVERFLOW); 
		L->elem = newbase;
		L->listsize += LISTINCREMENT;    
	}
	q = &(L->elem[i - 1]);              
	for (p = &(L->elem[L->length - 1]); p >= q; --p)
		*(p + 1) = *p;
	*q = e;
	++L->length;
	return OK;
}
Status visit_SqList(SqList L) {
	int i;
	if (L.length < 1) {
		printf("顺序表为空表！\n");
		return ERROR;
	}
	else {
		printf("顺序表中元素有：\n");
		for (i = 0; i < L.length; i++) {
			printf("%d ", L.elem[i]);
		}
		printf("\n");
		return OK;
	}
}
void CreatList_Sq(SqList* L) {
	int i, length;
	ElemType e;
	printf("请输入待创建线性表的表长：");
	scanf("%d", &length);
	printf("请按照非递减有序的顺序输入以下数据：\n");
	for (i = 1; i <= length; i++) {
		printf("请输入第 %d 个数据元素的值：", i);
		scanf("%d", &e);
		ListInsert_Sq(L, i, e);
	}
}

void MergeList_Sq(SqList La, SqList Lb, SqList* Lc) {
	ElemType* pa, * pb, * pc, * pa_last, * pb_last;
	Lc->listsize = Lc->length = La.length + Lb.length;
	pc = Lc->elem = (ElemType*)malloc(Lc->listsize * sizeof(ElemType));
	if (!Lc->elem) {
		printf("分配内存失败！\n");
		exit(OVERFLOW);
	}
	pa = La.elem;
	pb = Lb.elem; 
	pa_last = La.elem + La.length - 1;
	pb_last = Lb.elem + Lb.length - 1;
	while (pa <= pa_last && pb <= pb_last) {
		if (*pa <= *pb) *pc++ = *pa++;
		else  *pc++ = *pb++;
	}
	while (pa <= pa_last) *pc++ = *pa++;
	while (pb <= pb_last) *pc++ = *pa++;
}