-------------------------------------------------------【程序设计】---------------------------------------------------------题目 线性表的顺序存储实现--归并要求： La：顺序存储结构的线性表由小到大排序 Lb：顺序存储结构的线性表由小到大排序 Lc：顺序存储结

void Merge(SqList *La,SqList *Lb,SqList *Lc){

int i=1,j=1,k=1;
while(i<=La->length && j<=Lb->length){
    if(La->elem[i] <= Lb->elem[j]){
        Lc->elem[k++] = La->elem[i++];
    }
    else{
        Lc->elem[k++] = Lb->elem[j++];
    }
}
while(i<=La->length){
    Lc->elem[k++] = La->elem[i++];
}
while(j<=Lb->length){
    Lc->elem[k++] = Lb->elem[j++];
}

Lc->length = La->length + Lb->length;

}