2顺序表基本操作的实现(菜单的建立)

1、#define maxsize 100typedef int elemtype;typedef struct sqlistelemtype *elem;/elem存放地址int length;SqList;#include void InitList(SqList &L) L.elem=new elemtypemaxsize; if(L.elem=NULL) cout空间分配失败; return;L.length=0;void CreateList(SqList &L) coutL.length; for(int i=0;iL.elemi;void OutList(SqList L) for(

2、int i=0;iL.length;i+) coutL.elemit;int Getelem(SqList L,int i,elemtype &e) if(iL.length) cout位置不合理; return 0;e=L.elemi-1;return 1;请预览后下载！int Locateelem(SqList L,elemtype e) for(int i=0;iL.length;i+) if(e=L.elemi) return i+1; return -1;void InsertList(SqList &L,int i,elemtype e)if(L.length=maxsize)co

3、ut满表;return;if(iL.length+1)cout=i-1;j-)L.elemj+1=L.elemj;L.elemi-1=e;+L.length; void DeleteList(SqList &L,int i)if(L.length=0)cout空表;return;if(iL.length)cout位置不合理;return;for(int j=i;jL.length;j+)L.elemj-1=L.elemj;-L.length;请预览后下载！ void main()SqList L;InitList(L);int i; elemtype e;coutntt 1:顺序表建立; co

4、utntt 2:顺序表查找（位置）; coutntt 3:顺序表查找（值）; coutntt 4:顺序表插入; coutntt 5:顺序表删除; coutntt 6:顺序表输出; coutchoose;switch(choose) case 1:CreateList(L); break; case 2:couti; if(Getelem(L,i,e) coute; break; case 3: coute; i=Locateelem(L,e); if(i=-1) cout元素e不在顺序表中n; else coutn元素e在顺序表中第i位置n; 请预览后下载！ break; case 4: co

5、utie; InsertList(L, i, e); break; case 5:if(L.length=0) cout空表;return; if(iL.length) cout位置不合理;return; for(intj=i;jL.length;j+) L.elemj-1=L.elemj; L.length-; DeleteList(L, i); break; case 6:OutList(L); break; case 0:flag=0; break;/*SqList L;InitList(L);CreateList(L);OutList(L);int i; elemtype e;couti;if(Getelem(L,i,e) coute;coute;i=Locateelem(L,e);if(i=-1)cout元素e不在顺序表中n;elsecoutn元素e在顺序表中第i位置n;请预览后下载！coutie;