int ListInsert_Sq(SqList &L,int i,int e){// 演算法2.4，在順序線性表L中第i個位置之前插入新的元素e// i的合法值為1≤i≤L.length +1 if(i<1||i>L.length+1) return ERROR; ElemType *newbase,*p,*q; if(L.length>=L.listsize){ newbase=(ElemType*)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType)); L.elem=newbase; L.listsize+=LISTINCREMENT; } q=&(L.elem[i-1]); for(p=&(L.elem[L.length-1]);p>=q;--p) *(p+1)=*p; *q=e; ++L.length; return OK;}int ListDelete_Sq(SqList &L,int i, int &e){// 演算法2.5,在順序線性表L中刪除第i個位置的元素，並用e返回其值// i的合法值為1≤i≤L.length ElemType *q,*p; if(i<1||i>L.length) return ERROR; p=&(L.elem[i-1]); e=*p; q=L.elem+L.length-1; for(++p;p<=q;p++) *(p-1)=*p; L.length--; return OK;}