データ構造線形テーブルの挿入と削除演算

#include
using namespace std;
const int MAXSIZE=100;
typedef struct
{
    int s[MAXSIZE];
    int len;
}sqlist;                                //             


void display(sqlist seq);               //       
int InsertList(sqlist *seq,int a,int b);//        
//void DeleteList(sqlist seq,int a);//   i     


int main()
{
    sqlist seq;
    int p,q,i;
 
    cout<>seq.len;
    for(i=0;i>seq.s[i];
    display(seq);
    cout<>p;
    cout<>q;
    InsertList(&seq,p,q); 
    cout<seq->len+1)
    {
        cout<len>=MAXSIZE)
    {
        cout<len;j>=a;--j)
        {
            seq->s[j]=seq->s[j-1];
        }
    seq->s[a-1]=b;
    seq->len++;
    return(1); 
    }
}

#include
using namespace std;
const int MAXSIZE=10;
typedef struct
{
int s[MAXSIZE];
int len;
}sqlist;


void display(sqlist seq);
int DeleteList(sqlist *seq,int i);


int main()
{
sqlist seq;
cout<>seq.len;
for(i=0;i>seq.s[i];
display(seq);
cout<>p;
DeleteList(&seq,p);
cout<seq->len+1)
{
cout<len;j++)
seq->s[j-1]=seq->s[j];
   seq->len--;
}
return(1);
}