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

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

2、; 请输入表长" cin>>L.length; for(int i=0;i<L.length;i+) cin>>L.elemi;void OutList(SqList L) for(int i=0;i<L.length;i+) cout<<L.elemi<<"t"int Getelem(SqList L,int i,elemtype &e) if(i<1|i>L.length) cout<<"位置不合理" return 0;e=L.elemi-1;ret

3、urn 1;int Locateelem(SqList L,elemtype e) for(int i=0;i<L.length;i+) if(e=L.elemi) return i+1; return -1;void InsertList(SqList &L,int i,elemtype e)if(L.length=maxsize)cout<<"满表"return;if(i<1|i>L.length+1)cout<<"位置不合理"return;for(int j=L.length-1;j>=i-1

4、;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(i<1|i>L.length)cout<<"位置不合理"return;for(int j=i;j<L.length;j+)L.elemj-1=L.elemj;-L.length; void main()SqList L;InitList(L);int i; elemtype e;cout

5、<<"ntt 1:顺序表建立" cout<<"ntt 2:顺序表查找（位置）" cout<<"ntt 3:顺序表查找（值）" cout<<"ntt 4:顺序表插入" cout<<"ntt 5:顺序表删除" cout<<"ntt 6:顺序表输出" cout<<"ntt 0:退出"int flag;while(flag=1)int choose;cin>>choos

6、e;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&

7、lt;<"n元素"<<e<<"在顺序表中第"<<i<<"位置n" break; case 4: cout<<"n请输入插入的位置和元素：" cin>>i>>e; InsertList(L, i, e); break; case 5:if(L.length=0) cout<<"空表"return; if(i<1|i>L.length) cout<<"位置不合理&q

8、uot;return; for(intj=i;j<L.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;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<<"在顺序表中第"<&l