算法2.4

//在顺序线性表L中第i个位置之前插入新的元素e

Status ListInsert_Sq(Sqlist &L,int i, ElemType e)

{

     //i的合法值为1<=i<=ListLength_Sq(L)+1

     if(i<1 || i>L.length+1)

          return Error;   //i值不合法

     if(L.length>=L.listsize)

     {

          //当前存储空间已满,增加分配

          newbase=(ElemType*)realloc(L.elem,(L.listsize+ListIncrement)*sizeof(ElemType));

          if(!newbase)

               exit(OverFlow);      //存储分配失败

          L.elem=newbase;        //新基址

          L.listsize+=ListIncrement;   //增加存储容量

     }

     q=&(L.elem[i-1]);  //q为插入位置

     for(p=&(L.elem[L.length-1]);p>=q;--p)

     {

          *(p+1)=*p; //插入位置及之后的元素右移

          *q=e;        //插入e

          ++L.length;  //表长增1

     }

     return OK;          

}//ListInsert_Sq

转载于:https://www.cnblogs.com/luckylu/archive/2009/03/03/1402103.html