2021-10-19

         **顺序表的插入删除操作**
bool insertList(List& L,int i, int e)

{

if(i<1||i>L.size+1||L.size>= INIT_SIZE)
return false;
int* q=&(L.data[i-1]);
int* p=&(L.data[L.size-1]);
for(;p>=q;p–)
(p+1)=p;
q=e;
L.size++;
return true;
}
bool deleteElem(List& L, int i,int& e){
///
if(i<1||i>L.size||L.size==0)
return false;
intq=&(L.data[i]);
intp=&(L.data[L.size-1]);
e=(q-1);
for(;q<=p;q++)
*(q-1)=*q;
L.size–;
return true;
}