数据结构作业.docx

河南工业大学实验报告课程名称数据结构实验项目线性结构栈院系信息学院计科系专业班级计科 1302 姓名胡正旺学号 201316010218 指导老师阎娟日期 . 17 批改日期成绩实验一: 线性表顺序存储结构实验思想:首先定义结构体 typedef struct { ElemType *elem; int length; int listsize; }Sqlist;源源代码: #include<> #include<> #define ERROR 0 #define OK 1 #define list_size 100 #define listincrease 10 typedef int Status; typedef int ElemType; typedef struct { ElemType *elem; int length; int listsize; 创建线性表输入元素 void shuru(Sqlist &L1) 插入删除查找合并 void charu(Sqlist &L1) void shanchu(Sqlist &L1) void chazhao(Sqlist &L1) void hebing(Sqlist &Lc) }Sqlist; Sqlist lol; Status initlist(Sqlist &L){ =(ElemType *)malloc(list_size*sizeof(ElemType)); if(!) exit(ERROR); =0; =list_size; return OK; } void show(Sqlist &L,int i) // 显示{ int j;ElemType k; cout<<" 顺序表显示如下:"<<endl; for(j=0;j<i-1;j++) { k=[j]; cout<<k<<"->"; } if(j==i-1 && i>0) { k=[j]; cout<<k; } cout<<endl;} void shuru(Sqlist &L1)/* 输入元素*/ { int n,i,e; initlist(L1); cout<<" 输入顺序表的长度 n: "; cin>>n; if(n>){ =(ElemType *)realloc(,(n+listincrease )*sizeof(ElemType)); } cout<<" 输入顺序表的元素: "; for(i=0;i<n;i++){ cin>>e; [i]=e; ++; } show(L1,n); } Status list_increase(Sqlist &L,int i,ElemType e){ int *q,*p;ElemType *newbase; if(i<1||i>+1)return ERROR; if(>=){ newbase=(ElemType *)realloc(,(+ listincrease)*sizeof(ElemTy