seqlist template

#include <iostream.h>
typedef int ElemType;
typedef struct{
   ElemType *elem;
   int length;
}SeqList;

void InitSeq(SeqList &L,int n,ElemType a[])
{  int i=0;
   L.elem=new ElemType[n];
   while(i<n)
   {L.elem[i]=a[i];i++;}
   L.length=n;
}
void DispSeq(SeqList L)
{
    int i=0;
       while(i<L.length)
   {cout<<L.elem[i]<<'\t';i++;}
}
void UnionSeq(SeqList L1,SeqList L2,SeqList &L3)
{
   L3.length=L1.length+L2.length;
   L3.elem=new ElemType[L3.length];
   ElemType* pa,*pb,*pc;
   pa=&L1.elem[0];
   pb=&L2.elem[0];
   pc=&L3.elem[0];
   while(pa<L1.elem+L1.length&&pb<L2.elem+L2.length)
   {
       if(*pa<*pb)
       {*pc=*pa;pa++;pc++;}
       else
       {*pc=*pb;pb++;pc++;}
   }
   while(pb<L2.elem+L2.length)
   {*pc=*pb;pb++;pc++;}
    while(pa<L1.elem+L1.length)
   {*pc=*pa;pa++;pc++;}
}



void main()
{
   SeqList L1,L2,L3;
   ElemType a[100]={2,6,8};
   ElemType b[100]={1,3,5,7};
   InitSeq(L1,3,a);
   InitSeq(L2,4,b);
   DispSeq(L1);cout<<endl;
   DispSeq(L2);
   UnionSeq(L1,L2,L3);
   cout<<endl;
   DispSeq(L3);
}