1 Status ListDelete_Sq(SqList *L,int pos,ElemType &e)
 2 {
 3     ElemType *p,*q;
 4     if((pos<1)||(pos>(*L).length)) return ERROR;//输入地址不合法
 5     p=&((*L).elem[pos-1]);//p是被删除元素的位置
 6     e=*p;//被删除的值赋给e
 7     q=(*L).elem+(*L).length-1;//表尾元素的定位
 8     for(++p; p<=q; ++p) *(p-1)=*p;
 9     (*L).length--;
10     return OK;
11 }

 1 void ListSort_Sq(SqList *L)
 2 {
 3     int i, j, tmp, maxn;
 4     for(i=0; i<(*L).length-1; i++)
 5     {
 6         maxn = i;
 7         for(j=i; j<(*L).length; j++)
 8         {
 9             if((*L).elem[maxn]<(*L).elem[j])
10                 maxn=j;
11         }
12         tmp =(*L).elem[i];
13         (*L).elem[i]=(*L).elem[maxn];
14         (*L).elem[maxn]=tmp;
15     }
16 }       /*选择排序法*/

1 bool Compare_Sq(ElemType *a,ElemType *b)
2 {
3     if(*a==*b) return TRUE;
4     else return FALSE;
5 }

 1 Status LocateElem_Sq(SqList *L,ElemType e)
 2 {
 3     int pos;
 4     ElemType *q;
 5     q=(*L).elem;//获取数组的首元素地址
 6     while(pos<=(*L).length&&!Compare_Sq(q,&e))
 7     {
 8         pos++;
 9         q++;
10     }
11     if(pos<=(*L).length)
12         return pos;
13     else return 0;
14 }

 1 void MergeList_Sq(SqList *La,SqList *Lb,SqList *Lc)
 2 {
 3     //已知顺序线性表La与Lb的元素按值非递减排列
 4     //归并La和Lb得到新的顺序线性表Lc，Lc的元素也按值非递减排列
 5     ElemType *pa,*pb,*pa_last,*pb_last,*pc;
 6     pa=(*La).elem;
 7     pb=(*Lb).elem;
 8     (*Lc).listsize=(*Lc).length=(*La).length+(*Lb).length;
 9     pc=(*Lc).elem=(ElemType *)malloc((*Lc).listsize*sizeof(ElemType));
10     if(!(*Lc).elem) exit(OVERFLOW);//存储分配失败
11     pa_last=(*La).elem+(*La).length-1;
12     pb_last=(*Lb).elem+(*Lb).length-1;//？？？
13     while(pa<=pa_last&&pb<=pb_last)//归并
14     {
15         if(*pa<=*pb) *pc++=*pa++;
16         else *pc++=*pb++;
17     }
18     while(pa<=pa_last) *pc++=*pa++;//插入La的剩余元素
19     while(pb<=pb_last) *pc++=*pb++;//插入Lb的剩余元素
20 }

1 void Output_L(SqList *L)
2 {
3     int i;
4     for(i=0; i<(*L).length; i++)
5         printf("%d ",(*L).elem[i]);
6     cout<<endl;
7     cout<<"The length of the SqList:"<<(*L).length<<endl<<endl;
8 }

1 void Output_L(SqList *L)
2 {
3     int i;
4     for(i=0; i<(*L).length; i++)
5         printf("%d ",(*L).elem[i]);
6     cout<<endl;
7     cout<<"The length of the SqList:"<<(*L).length<<endl<<endl;
8 }

 1 int main()
 2 {
 3 SqList* L1=new SqList();  4 InitList_Sq(L1);//初始化函数的测试  5 (*L1).length=10;  6  7 for(int i=0; i<(*L1).length; i++)  8  {  9 (*L1).elem[i]=i; 10  } 11  Output_L(L1); 12 13 int a,n; 14 cout<<"Insert test"<<endl<<"Please input a legal position :"<<endl; 15 cin>>a; 16 cout<<"Please input the data:"<<endl; 17 cin>>n; 18  ListInsert_Sq(L1,a,n); 19  Output_L(L1); 20 cout<<"Delete test"<<endl<<"Please input a legal position :"<<endl; 21 cin>>a; 22  ListDelete_Sq(L1,a,n); 23 cout<<"The delete data is "<<n<<endl; 24  Output_L(L1); 25 26 cout<<"Sort test"<<endl; 27  ListSort_Sq(L1); 28  Output_L(L1); 29 30 cout<<"Now you can create a personal SqList.Please input ten data."<<endl; 31 SqList* L2=new SqList(); 32  InitList_Sq(L2); 33 for(int i=0; i<10; i++) 34  { 35 int c; 36 cin>>c; 37 ListInsert_Sq(L2,i+1,c); 38  } 39 40  Output_L(L2); 41  ListSort_Sq(L2); 42  Output_L(L2); 43 44 45 cout<<"Lotate test"<<endl<<"Please input a data:"<<endl; 46 cin>>a; 47 int b=LocateElem_Sq(L2,a); 48 if(b) cout<<"The first position of "<<a<<" is "<<b+1<<endl; 49 else cout<<"Fail to find '"<<a<<"' in List2."<<endl; 50 51 52 cout<<"MergeList test"<<endl; 53 SqList* L3=new SqList(); 54  MergeList_Sq(L1,L2,L3); 55  Output_L(L3); 56 57  DestroyList_Sq(L1); 58  DestroyList_Sq(L2); 59  DestroyList_Sq(L3); 60 return 0; 61 }