2顺序表基本操作的实现

1、#definemaxsize100typedefintelemtype;typedefstructsqlist(elemtype*elem;/elem存放地址intlength;SqList;#include<>voidInitList(SqList&L)(=newelemtypemaxsize;if=NULL)(cout<<”空间分配失败"return;=0;voidCreateList(SqList&L)(cout<<"请输入表长"cin>>for(inti=0;i<i+)cin>&g

2、t;i;voidOutList(SqListL)(for(inti=0;i<i+)cout<<i<<"t"intGetelem(SqListL,inti,elemtype&e)(if(i<1|i>(cout<<"位置不合理"return0;e=i-1;return1;intLocateelem(SqListL,elemtypee)(for(inti=0;i<i+)if(e=i)returni+1;return-1;voidInsertList(SqList&L,inti,elem

3、typee)(if=maxsize)(cout<<"满表"return;if(i<1|i>+1)(cout<<"位置不合理"return;for(intj=;j>=i-1;j-)j+1=j;i-1=e;+;voidDeleteList(SqList&L,inti)(if=0)(cout<<"空表"return;if(i<1|i>(cout<<"位置不合理"return;for(intj=i;j<j+)j-1=j;voidma

4、in()(SqListL;InitList(L);inti;elemtypee;cout<<"ntt1:顺序表建立"cout<<"ntt2:顺序表查找(位置)"cout<<"ntt3:顺序表查找(值)"cout<<"ntt4:顺序表插入"cout<<"ntt5:顺序表删除"cout<<"ntt6:顺序表输出"cout<<"ntt0:退出"intflag;while(flag

5、=1)(intchoose;cin>>choose;switch(choose)(case1:CreateList(L);break;case2:cout<<"n请输入查找的位置："cin>>i;if(Getelem(L,i,e)cout<<e;break;case3:cout<<"n请输入查找的元素：”；cin>>e;i=Locateelem(L,e);if(i=-1)cout<<"元素"<<e<<"不在顺序表中n”;else

6、cout<<"n元素"<<e<<"在顺序表中第"<<i<<"位置n”;break;case4:cout<<"n请输入插入的位置和元素:n.cin>>i>>e;InsertList(L,i,e);break;case5:if=0)cout<<"空表"return;if(i<1|i>cout<<"位置不合理"return;for(intj=i;j<j+)j-1=j

7、;DeleteList(L,i);break;case6:OutList(L);break;case0:flag=0;break;/*SqListL;InitList(L);CreateList(L);OutList(L);inti;elemtypee;cout<<"n请输入查找的位置："cin>>i;if(Getelem(L,i,e)cout<<e;cout<<"n请输入查找的元素：”；cin>>e;i=Locateelem(L,e);if(i=-1)cout<<"元素"<<e<<"不在顺序表中n"elsecout<<"n元素"<<e<<"在顺序表中第"<<i<<