线性表算法2.2：顺序表的合并

 

//破坏原有的链表实现合并：

void MergeList(List La,List Lb,List &Lc)

{

       ListClear(Lc);

       ElemType ea,eb;

       while(!ListEmpty(La)&&!ListEmpty(Lb)){

              GetElem(La,1,ea);

              GetElem(Lb,1,eb);

              if(ea<eb){

                     ListInsert(Lc,ListLength(Lc)+1,ea);

                     DeleteList(La,2);

              }

              else{

                     ListInsert(Lc,ListLength(Lc)+1,eb);

                     DeleteList(Lb,2);

              }           

       }

       if(ListEmpty(La)){

              while(!ListEmpty(Lb)){

                     GetElem(Lb,1,eb);

                     ListInsert(Lc,ListLength(Lc)+1,eb);

                     DeleteList(Lb,2);

              }

       }