线性表的顺序表示和实现

1、实验1 线性表的顺序表示和实现姓名： 叶展望 学号:Xb 时间：10.281、 实验目的1. 掌握线性表的动态分配顺序存储结构2. 掌握线性表合并算法。2、 实验内容已知顺序线性表La和Lb的元素按值非递减排列，归并La和Lb得到新的顺序线性表Lc，Lc的元素也按值非递减排列。（算法2.7）3、 实验步骤：1. 创建线性表La和Lb。2. 合并La和Lb得到Lc。3. 输出La、Lb、Lc。4、 算法说明先建立LA LB数据表在合并数据表成LC并排列顺寻5、 测试结果6、 分析与探讨合并两线性表时，数据元素按非递减排列7、 附录：源代码#define TRUE 1#define FALSE 0

2、#define OK 1#define ERROR 0#define INFEASIBLE -2#define OVERFLOW -2typedef int Status;typedef int ElemType;#include#define LIST_INIT_SIZE 100#define LISTINCREMENT 10typedef struct ElemType *elem; int length; int listsize;SqList;Status InitList_Sq(SqList &L) L.elem = new(ElemTypeLIST_INIT_SIZE*sizeof

3、(ElemType); if (!L.elem) return OVERFLOW; L.length = 0; L.listsize = LIST_INIT_SIZE; return OK;Status DestroyList_Sq(SqList &L) if (L.elem) delete(L.elem);L.elem=NULL;return OK;/DestroyList_SqElemType *realloc(SqList L) ElemType *p,*q,*r;p = new(ElemType(L.listsize+LISTINCREMENT)*sizeof(ElemType);if

4、(!p) return NULL; q=p; r=L.elem;for(int i=1;i=L.length;i+) *q=*r; q+; r+;delete L.elem;return p;Status ListInsert_Sq(SqList &L, int i, ElemType e) ElemType *p;if (i L.length+1) return ERROR;if (L.length = L.listsize) ElemType *newbase = realloc(L);if (!newbase) return ERROR;L.elem = newbase;L.listsi

5、ze += LISTINCREMENT;ElemType *q = &(L.elemi-1);for (p = &(L.elemL.length-1); p=q; -p) *(p+1) = *p;*q = e;+L.length;return OK;Status ListInsert(SqList &L,ElemType e)if(!L.length)L.elem0=e;int i=L.length;while(e0)L.elemi=L.elemi-1;i-;L.elemi=e;L.length+;return OK;Status MergeList_Sq(SqList La, SqList

6、Lb, SqList &Lc) ElemType *pa,*pb,*pc,*pa_last,*pb_last;pa = La.elem; pb = Lb.elem;Lc.listsize = Lc.length = La.length+Lb.length;pc = Lc.elem = new(ElemTypeLc.listsize*sizeof(ElemType);if (!Lc.elem)return OVERFLOW;pa_last = La.elem+La.length-1;pb_last = Lb.elem+Lb.length-1;while (pa = pa_last & pb =

7、pb_last) if (*pa = *pb) *pc+ = *pa+;else *pc+ = *pb+;while (pa = pa_last) *pc+ = *pa+;while (pb = pb_last) *pc+ = *pb+;return(OK);1; / MergeListvoid ListTraverse_Sq(SqList L) int i;for(i=1;i=L.length;i+) coutL.elemi-1 ;coutendl;void main() int i;SqList La,Lb,Lc;ElemType z1,z2;InitList_Sq(La);cout读入3个元素并插入到顺序表La中endl;for(i=1;iz1;ListInsert(La,z1);cout顺序表La中所有元素如下:endl;ListTraverse_Sq(La);InitList_Sq(Lb);cout读入3个元素并插入到顺序表Lb中endl;for(i=1;iz2; ListInser