文档介绍：#define maxsize 100
typedef int elemtype;
typedef struct sqlist
{
elemtype *elem;//elem 存放地址
int leurn;
}
for(int j=;j>=i-1;j--)
[j+1]=[j];
[i-1]=e;
++;
}
void DeleteList(SqList &L,int i)
{
if==0)
{
cout<<"空表";
return;
}
if(i<1||i>
{
cout<<"位置不合理";
3return;
}
for(int j=i;j<;j++)
[j-1]=[j];
;
}
void main()
{
SqList L;
InitList(L);
int i;
elemtype e;
cout<<"\n\t\t 1:顺序表建立";
cout<<"\n\t\t 2:顺序表查找（位置）";
cout<<"\n\t\t 3:顺序表查找（值）";
cout<<"\n\t\t 4:顺序表插入";
cout<<"\n\t\t 5:顺序表删除";
cout<<"\n\t\t 6:顺序表输出";
cout<<"\n\t\t 0:退出";
int flag;
while(flag=1)
{
4int choose;
cin>>choose;
switch(choose)
{
case 1: CreateList(L);
break;
case 2: cout<<"\n 请输入查找的位置：";
cin>>i;
if(Getelem(L,i,e))
cout<<e;
break;
case 3: cout<<"\n 请输入查找的元素:";
cin>>e;
i=Locateelem(L,e);
if(i==-1)
cout<<"元素"<<e<<"不在顺序表中\n";
else
cout<<"\n 元素"<<e<<"在顺序表中第"<<i<<"位置\n";
break;
case 4: