顺序表的合并算

//将两个有序顺序表合并为一个新的有序顺序表
#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 20
typedef struct{
	int *data;//动态存储用*data，静态为data[MAXSIZE] 
	int length;
}SqList;
//链表初始化 
int ListInit(SqList *L){
	L->data = (int*)malloc(sizeof(int) * MAXSIZE);
	if(! L->data){
		return 0;
	}
	L->length = 0;
	return 1;
}

void PrintList(SqList L){//是L.length,不是L->length 
	int i;
	for(i = 1; i <= L.length; i++)
	{
		printf("%d ", L.data[i - 1]);
	}
	printf("\n");
}

bool Merge(SqList L1, SqList L2, SqList *L3){
	int i = 0, j = 0, k = 0;
	if(L1.length + L2.length > MAXSIZE){//L3放不下 
		return false;
	}
	//L1、L2都取完才结束 
	while(i < L1.length || j < L2.length){
		if(L1.data[i] < L2.data[j]){
			L3->data[k++] = L1.data[i++];	
			L3->length++;					
		}
		else{
			L3->data[k++] = L2.data[j++];
			L3->length++;
		}
	} 
	return true;
}

int main(){
	int i, e;
	SqList L1, L2;
	SqList L3;	
	//顺序表初始化并赋值 
	ListInit(&L1);
	ListInit(&L2);	
	ListInit(&L3);	
	for(i= 0; i < MAXSIZE / 4; i++){
		L1.data[i] = i*2;
		L1.length++;
	}
	for(i= 0; i < MAXSIZE / 5; i++){
		L2.data[i] = i*2 + 1;
		L2.length++;
	}	
	//打印表
	printf("List A:");
	PrintList(L1);	
	printf("List B:");
	PrintList(L2);	
	
	Merge(L1, L2, &L3);
	printf("List C:");
	PrintList(L3);
}

表中数据为自动生成，若想手动输入，插入ListInsert（）函数稍加修改即可。

int ListInsert(SqList *L, int i, int e){
	int k;
	if(i < 1 || i > L->length + 1){
		return 0;
	}
	if(L->length >= MAXSIZE){
		return 0;
	}
	if(i <= L->length){
		for(k = L->length - 1; k >= i - 1; k--){
			L->array[k + 1] = L->array[k];
		}
	}
	L->array[i - 1] = e;
	L->length++;
	return 1;
}