有序顺序表的合并

1.创建有序表

2.合并有序表

#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define MaxSize 100
#define ok 1
#define error 0
#define overflow -2
typedef int Status;
typedef int ElemType;
typedef struct{			    //定义结构类型 
	ElemType *data;			//顺序表 动态分布数组的指针
	int length;				//顺序表的当前长度 
	int capacity;			//顺序表的最大存储容量 
}SqList; 			        //顺序表类型 
//初始化操作，建立一个空的线性表 
Status InitList_Sq(SqList &L){
	L.data=(ElemType*)malloc(MaxSize*sizeof(ElemType));
	if(!L.data)
		exit(overflow);
	L.length = 0;
	L.capacity = MaxSize;
	return ok;
}
//顺序表的指定位置插入
Status ListInsert_Sq(SqList &L,int i,ElemType e){			
	if(i<1||i>L.length+1)	//判断i值是否合理，若不合理，返回error 
		return error;
    if(L.length>=L.capacity)		 
    {
        ElemType *newbase=(ElemType*)realloc(L.data,2*L.capacity*sizeof(ElemType));
    if(!newbase)
        exit(overflow);
    L.data=newbase;
    L.capacity *= 2;
    }
    ElemType *q=&(L.data[i-1]);
    for(ElemType *p=&(L.data[L.length-1]);p>=q;--p)
        *(p+1)=*p;
    *q = e;
    ++L.length;
    return ok;
}
//打印顺序表 
void print(SqList L){
    int i;
    for(i = 0;i < L.length-1;i++)
        cout<<L.data[i]<<' ';
    cout<<L.data[i];
    cout<<"\n";
}
//合并顺序表 
void MergeList(SqList La,SqList Lb,SqList &Lc){
	ElemType *pa,*pb,*pc,*pa_last,*pb_last;
	InitList_Sq(Lc);
	pa = La.data;
	pb = Lb.data;
	Lc.capacity = Lc.length = La.length + Lb.length;
	pc = Lc.data = (ElemType*)malloc(sizeof(ElemType)*Lc.capacity);	
	if(!Lc.data)
		exit(overflow);
	pa_last = La.data + La.length - 1;
	pb_last = Lb.data + 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++ = *pb++;
}

int main()
{
    int x,y;
    int i;
    ElemType a;
    SqList la,lb,lc;
    InitList_Sq(la);
    InitList_Sq(lb);
    cout<<"输入第一个顺序表的长度:";
    cin>>x;
    cout<<"输入长度为"<<x<<"的有序表:";
    for(i=1;i<=x;i++)
        {
            cin>>a;
            ListInsert_Sq(la,i, a);
        }
    cout<<"输入第二个顺序表的长度:";
    cin>>y;
    cout<<"输入长度为"<<y<<"的有序表:";
        for(i=1;i<=y;i++)
        {
            cin>>a;
            ListInsert_Sq(lb,i, a);
        }
    MergeList(la,lb,lc);
    cout<<"合并后的有序表为:";
    print(lc);
}