线性表-曾祥康.docVIP

线性表-曾祥康 #includeiostream #includeprocess.h using namespace std; const LIST_INIT_SIZE = 100; const LISTINCREMENT =10; typedef int ElemType; typedef struct{ ElemType * elem; int length; int listsize; int incrementsize; }SqList; void ErrorMessage(char *s) { cout s endl; exit(1); } void InitList_Sq(SqList L,int maxsize=LIST_INIT_SIZE,int incresize=LISTINCREMENT) { L.length=0; L.elem=new ElemType [maxsize]; L.listsize=maxsize; L.incrementsize=incresize; } int LocateElem_Sq(SqList L,ElemType e) { int i=1; int *p=L.elem; while(i=L.length *p++!=e) ++i; if(i=L.length) return i; else return 0; } void increment(SqList L) { ElemType * a=new ElemType[L.listsize+L.incrementsize]; for(int i=0;iL.length;i++) a[i]=L.elem[i]; delete [] L.elem; L.elem=a; L.listsize += L.incrementsize; delete [] a; } void ListInsert_Sq(SqList L,int i,int e) { if(i1 || iL.length+1) ErrorMessage(i is illegle); if(L.length=L.listsize) increment(L); ElemType * q=(L.elem[i-1]); for(ElemType *p=(L.elem+L.length-1);p=q;--q) *(p+1)=*p; *q=e; ++L.length; } void ListDelete_Sq(SqList L,int i,ElemType e) { if((i1)||(iL.length)) ErrorMessage(i is illegle); ElemType *p=(L.elem[i-1]); e=*p; ElemType *q=L.elem+L.length-1; for(++p;p=q;++p) *(p-1) = *p; --L.length; } void DestoryList_Sq(SqList L) { delete [] L.elem; L.listsize=0; L.length=0; } int compare(SqList A, SqList B) { //若AB,则返回-1,若A=B,则返回0;若AB,则返回1 int j=0; while(jA.length jB.length) { if(A.elem[j]B.elem[j]) return -1; else if(A.elem[j]B.elem[j]) return 1; else j++; } if(A.length==B.length) return (0); else if(A.lengthB.length) return (-1); else return (1); } void exchange1(SqList A,int m,int n) { //本算法实现顺序表中前m个元素和后n个元素的互换 for(int k=1;k=n;k++) { ElemType w=A.elem[m+k-1]; for(int j=m+k-1;j=k;j--) A.elem[j]=A.elem[j-1]; A.elem[k-1]=w; } } void invert(ElemType *R,int s,int t) //这段是错的，咱办？ { for(int k=s;k=(s+t)/2;k++) { ElemType w=R[k]; R[k]=R[t-k+s]; R[t-k+s]=w; } } void exchange2(SqList A,int