合并顺序表

#include <stdio.h>
#include <stdlib.h>
#define ElemType int
//顺序表采用动态存储空间
typedef struct{
    ElemType *elem;//存储空间基地址 
    int length;//元素长度
    //int listsize;//当前分配的存储容量 
}SqList;
void merge(SqList A,SqList B,SqList &C)
{
    int i,j,k;
    i = j = k = 0;
    while(i < A.length && j < B.length)
    {
        if(A.elem[i] > B.elem[j])
        {
            C.elem[k] = B.elem[j];
            k ++ , j ++;
        }
        else{
            C.elem[k] = A.elem[i];
            k ++ , i ++;
        }
    }
    while(i < A.length)
    {
        C.elem[k] = A.elem[i];
        k ++ , i ++;
    }
    while(j < B.length)
    {
        C.elem[k] = B.elem[j];
        k ++ , j ++;
    }
    C.length = k;
}
int main()
{
    SqList A,B,C;
    int i;
    scanf("%d%d",&A.length,&B.length);//‘.’号为一级运算符,&为二级 
    A.elem = (ElemType *)malloc(sizeof(ElemType)*(A.length));//根据基地址开辟空间 
    B.elem = (ElemType *)malloc(sizeof(ElemType)*(B.length));
    C.elem = (ElemType *)malloc(sizeof(ElemType)*(B.length+A.length));
    for(i=0;i<A.length;i++)
        scanf("%d",&A.elem[i]);
    for(i=0;i<B.length;i++)
        scanf("%d",&B.elem[i]);
    merge(A,B,C);
    printf("合并后线性表:");
    for(i=0;i<C.length;i++)
        printf("%d,",C.elem[i]);
    return 0;
}