算法设计基础实验43.docVIP

算法设计基础实验 班级： 学号： 姓名： 实验一 线性表的应用 1实验目的：给定一线性表L=（15,25,05,36,78,85,23），写出顺序存储和链接存储结构下的插入、删除、排序操作的算法及程序。 2 实验代码： #includeiostream #includestdlib.h using namespace std; typedef int ElemType; struct List { ElemType *list; int len; int MaxSize; }; void InitList(List L); void InitList(List L,int ms); bool GetList(List L); bool InsertList(List L,ElemType item,int num); bool DeleteList(List L,ElemType item); bool EmptyList(List L); int LenthList(List L); void OutputList(List L); void ClearList(List L); void SortList(List L); void main() { List a; ElemType x; int l,p; InitList(a,20); coutplease input your list and end with 0endl; if(GetList(a)==1) coutCreate list successfully!endl; else { coutCreate list failly!endl; exit(1); } if(EmptyList(a)==1) { coutThe list is empty!endl; exit(0); } OutputList(a); l=LenthList(a); coutThe length of list is lendl; coutplease input your new element and position!endl; cinxp; if(InsertList(a,x,p)==1) coutelement insert successfully!endl; else coutelement insert failly!endl; OutputList(a); coutplease input the element you want to delete:endl; cinx; if(DeleteList(a,x)==1) coutelement delete successfully!endl; else coutelement delete failly!endl; OutputList(a); coutnow,we resort the list in order!endl; SortList(a); OutputList(a); ClearList(a); } void InitList(List L) { L.list=NULL; L.len=L.MaxSize=0; } void InitList(List L,int ms) { if(ms=0) {coutms is invalid!endl; exit(1);} L.MaxSize=ms; L.list=new ElemType[ms]; if(!L.list) { cerrdynamic initial is failed!endl; exit(1); } L.len=0; } bool GetList(List L) { for(int i=0;iL.MaxSize;i++) { cinL.list[i]; if(L.list[i]==0) return true; L.len++; } cin.clear(); return false; } bool InsertList(List L,ElemType item,int num) { if(num1||numL.len+1) { coutThe position is invalid!endl; return false; } if(L.len==L.MaxSize) { ElemType *p=new ElemType[2*L.Max