顺序表的基本操作--插入,删除,合并

1、成绩辽宁工程技术大学上机实验报告实验名称顺序表的基本操作的实现院系软件学院专业软件工程班级软件15-3姓名ZOE学号日期2016.09.27实验目的简述本次实验目的： 1掌握线性表顺序存储结构的特点。2掌握线性表顺序存储结构的基本操作(创建、插入、删除)的实现。3. 通过顺序表有序表的合并的实现，掌握顺序表操作特点。实验准备你为本次实验做了哪些准备：在课后认真复习，基于上课的基础上，对于线性表的存储，插入，删除，合并等有了一定的了解，对于书上给出的程序反复捉摸，达到了较熟练的程度。实验进度本次共有 1 个练习，完成 个。实验总结日本次实验的收获、体会、经验、问题和教训：顺序表初始化、插入、删除

2、算法。实现两个有序表合并算法. #include "malloc.h"#include "stdlib.h"#define OK 1#define OVERFLOW -1#define ERROR 0#define LIST_INIT_SIZE 100#define LISTINCREMENT 10typedef int ElemType;typedef int Status;/*-顺序表的存储结构定义-*/typedef structElemType *elem;int length;int listsize;sqlist;/*-初始化顺序表L-*/S

3、tatus InitList_sq(sqlist *L) L->elem=(ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType); if(!L->elem) exit(OVERFLOW); L->length=0; L->listsize=LIST_INIT_SIZE; return OK;/*-顺序表L插入-*/Status ListInsert_Sq(sqlist *L,int i,ElemType e) ElemType *newbase,*p,*q; if(i<1|i>L->length+1) re

4、turn 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=L->listsize+LISTINCREMENT; q=&(L->elemi-1); for(p=&(L->elemL->length-1);p>=q;-

5、p) *(p+1)=*p; *q=e; +L->length; return OK;/*-顺序表L删除-*/Status ListDelete_Sq(sqlist *L,int i,ElemType *e) ElemType *p,*q; if(i<1|i>L->length) return ERROR; p=&(L->elemi-1); *e=*p; q=L->elem+L->length-1;/*printf("%d,%d,%d,%d",p,L->elem,L->length,q);*/ for(+p;p&l

6、t;=q;+p) *(p-1)=*p; -L->length; return OK;/*-合并-*/void Mergelist(sqlist La,sqlist Lb,sqlist Lc)int i,j,k;i=j=k=0;while(i<La.length)&&(j<Lb.length) if(La.elemi<Lb.elemj) Lc.elemk+ = La.elemi+; else Lc.elemk+=Lb.elemj+; while(i<La.length) Lc.elemk+ =La.elemi+; while(j<Lb.leng

7、th) Lc.elemk+ =Lb.elemj+;/*-main函数-*/main() sqlist La,Lb,Lc; int i; int n=5; ElemType e;/*-INIT-*/ if(InitList_sq(&La) printf("Init is ok!n"); printf("Length: %dn",La.length); printf("Listsize: %dnn",La.listsize); else printf("error!"); /*-INIT-*/ if(InitL

8、ist_sq(&Lb) printf("Init is ok!n"); printf("Length: %dn",Lb.length); printf("Listsize: %dnn",Lb.listsize); else printf("error!");/*-INIT-*/ if(InitList_sq(&Lc) printf("Init is ok!n"); printf("Length: %dn",Lc.length); printf("Li

9、stsize: %dnn",Lc.listsize); else printf("error!"); /*-顺序表La输入初始值-*/ printf("Please input the values of La:n"); for(i=1;i<=n;i+) scanf("%d",&e) ; if(ListInsert_Sq(&La,i,e)!=OK) break; for(i=1;i<=La.length;i+) printf("e%d=%dn",i-1,La.elemi-1);

10、 printf("Length: %dnn",La.length);/*-INSERT-*/ printf("Please input the place of insert:n"); scanf("%d",&i); printf("Please input the elemvalue:n"); scanf("%d",&e); if(ListInsert_Sq(&La,i,e)=OK) for(i=1;i<=La.length;i+) printf("e%

11、d=%dn",i-1,La.elemi-1); printf("Length: %dnn",La.length); /*-DELETE-*/ printf("Please input the place of delete:n"); scanf("%d",&i); if(ListDelete_Sq(&La,i,&e)=OK) printf("The deleted elem is: %dn",e); for(i=1;i<=La.length;i+) printf("

12、e%d=%dn",i-1,La.elemi-1); printf("Length: %dn",La.length);/*-顺序表Lb输入初始值-*/ printf("Please input the values of Lb:n"); for(i=1;i<=n;i+) scanf("%d",&e) ; if(ListInsert_Sq(&Lb,i,e)!=OK) break; for(i=1;i<=Lb.length;i+) printf("e%d=%dn",i-1,Lb.elemi-1); printf("Length: %dnn",Lb.length); /*-合并-*/ Lc.length=La.length+Lb.length; Mergelist(La,Lb,Lc); for(i=1;i<=Lc.length;i+) printf("n合并后的数组为n"); printf("e%d=%dn",i-1,