严蔚敏版教材，算法2.4，代码实现

#include 
    
     using namespace std;typedef int element;#define maxsize 100typedef struct{  element aa[maxsize];  int last;}sqlist;int main(){  int len,pos;  sqlist *la;  int *p,*q;  la=(sqlist *)malloc(sizeof(sqlist));  cout<<"输入线性表的长度"<
     
      >len;  la->last=len-1;  cout<<"输入元素"<
      
       >la->aa[i];  cout<<"输入要删除的位置"<
       
        >pos;  q=&(la->aa[pos-1]); // cout<<*q<
        
         aa[la->last]);  //cout<<*p<
         
          aa[la->last]);p++) *p=*(p+1); la->last--; for(int i=0;i<=la->last;++i) cout<
          
           aa[i]<<" "; cout<