《线性表的顺序存储》实验报告

需解决的的问题利用顺序表，设计一组输入数据。数据结构的定义typedefstruct{ElemType*elem;intlength;intlistsize;}SqList;程序的结构图函数的功能初始化一个空顺序表voidInitSqList(SqList*L){L->elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType));if(!L->elem)exit(OVERFLOW);L->length=0;L->listsize=LIST_INIT_SIZE;}输入元素voidPushSqList(SqList*L){inti;printf("inputthelengthofthelist:");scanf("%d",&L->length);printf("inputthesqlist:");for(i=0;i<L->length;i++){printf("inputthe%dthnumber:",i+1);scanf("%d",&L->elem);}}在指定位置插入一个指定的元素voidInsertSqList(SqList*L,inti,ElemTypex){ElemType*newbase;intn,m;if(i<1||i>L->length+1){printf("ERROR!");}if(L->length>=L->listsize){newbase=(ElemType*)realloc(L->elem,(L->listsize+LISTINCREMENT)*sizeof(ElemType));if(!newbase)exit(OVERFLOW);L->elem=newbase;L->listsize+=LISTINCREMENT;}else{for(n=L->length;n>=i;n--){++L->length;L->elem[n]=L->elem[n-1];}L->elem[i-1]=x;printf("thelistis:");for(m=0;m<L->length+1;n++)printf("%d",L->elem[n]);}删除指定位置的元素voidDelSqList(SqList*L,inti){ElemType*p,*q;ElemTypex;intn;if(i<1||i>L->length)printf("ERROR!");p=&(L->elem[i-1]);x=*p;for(q=p;q<&(L->elem[L->length-1]);q++)*q=*(q+1);L->length--;printf("theelementwhichisdeleteis%d",x);printf("thelistis:");for(n=0;n<L->length-1;n++)printf("%d",L->elem[n]);}将顺序表中所有的元素颠倒voidChangeoverSqList(SqList*L){SqListS;inti,j;if(L->length==L->listsize)S.elem=(ElemType*)malloc(L->length*sizeof(ElemType));if(!S.elem)exit(OVERFLOW);else{for(i=0;i<L->length;i++)S.elem[i]=L->elem[L->length-i-1];for(i=0;i<L->length;i++)L->elem[i]=S.elem[i];}printf("thelistis:");for(j=0;j<L->length;i++)printf("%d",L->elem[i]);}按顺序输出表中元素voidPrintSqList(SqList*L){inti;for(i=0;i<L->length;i++)printf("%d",L->elem[i]);}摧毁顺序表

voidDestroySqList(SqList*L){if(L->elem)free(L->elem);}清空顺序表voidClearSqList(SqList*L){L->length=0;}查找指定位置的元素，并返回该元素的值intGetElem(SqList*L,inti){ElemTypex;if(i<1||i>L->length+1){printf("ERROR!");}else{x=L->elem[i-1];printf("theelemis%d",x);}}5・输入/输出数据1）创建一个顺序表，先输入表长度，然后输入数据creatinput：inputinputinputinputinputacreatinput：inputinputinputinputinputasqlistFirstthethethethethethelengthofthelist:5sqlist=inputtheitlinumber2th3th4th5thnumber=2number=3numbei?：4numbep：522）选择菜单，进行不同操作choosewhattodo:1.1nsertoneeLementintotheListDeleteoneeLementoftheListChangeouertheList4.outputtheeLementsoftheListDestroytheListEmptytheListGetthenu.mbei*oftheelementsoFthelistGettheeLementbyseapchinqitslacatian9.exitthemenu.inputthenunber-whichyouchoose选‘1’，在指定位置插入指定元素inputthenumbepwhichyouchoose1inputtheLocation选‘2’，删除指定位置的元素inputthenumbepwhichyouclioose2inputthelocation选‘3’，颠倒顺序表中元素的顺序选‘4’，按顺序输出表中的元素选‘5’，摧毁顺序表选‘6’，清空线性表选‘7’，输出当前顺序表的长度chooseuhattodo:1.1nsertoneeLementintothelistDeleteoneeLementoftheListChangeouepthelist4.outputtheelements：ofthelist5.DestroytheList6-EmptytheList7.Getthenu.nkber-oftheeleinentsofthelist.Gettheelenentbys&archinsiitslocation.exitthemenu.inputthenu.mbepuhichyouchoose7thenumberofth