线性表-c++-直接交作业.docVIP

实验1 线性表 实验目的：掌握线性表 实验内容：建立含有若干个元素的顺序表，并将结果在屏幕上输出。 对刚建立的顺序表实现插入、删除、修改、查找，并将结果在屏幕上输出。 算法描述：利用线性表 程序清单 #includestdio.h #includestdlib.h /*线性表*/ struct TLink { int data; struct TLink * next; }; struct TLink * new_item(int number) { struct TLink * r = 0; r = (struct TLink *)malloc(sizeof(struct TLink)); r-data = number; r-next = 0; return r; } /*查询数据*/ struct TLink * lookup(struct TLink * root, int number) { struct TLink * h = root; while(h) { if (h-data == number) return h; h = h-next ; }/*end lookup*/ return 0; } /*加一个数据*/ void append(struct TLink * * root, int number) { struct TLink * r = 0, * n = 0; if (!root) return ; /*不记录重复元素*/ if (lookup(*root, number)) return; /*如果表为空则新建表*/ r = *root; if (!r) { *root = new_item(number); return ; } /*排表头 */ if (number r-data ) { n = new_item(number); n-next = r; *root = n; return ; }/*end if*/ /*在有序线性表中查找位置插入元素*/ while(r) { n = r-next ; /*如果已经是表尾则直接追加*/ if (!n) { n = new_item(number); r-next = n; return ; }/*end if*/ /*在中央某处插入*/ if (number n-data ) { r-next = new_item(number); r-next-next = n; return ; }/*end if*/ r = n; }/*end while*/ }/*end append*/ /*输出有序线性表*/ void print(struct TLink * root) { struct TLink * r = root; printf(【); while(r) { printf(%d , r-data ); r = r-next ; }/*end while*/ printf(\b】\n); }/*end print*/ /*合并*/ void merge(struct TLink ** h0, struct TLink ** h1) { struct TLink * h = 0, * k = 0; if (!h0 || !h1) return ; h = *h1; while(h) { append(h0, h-data ); k = h; h = h-next ; free(k); }/*end h*/ h1 = 0; } int main(void) { int i = 0; struct TLink * x=0, *y = 0; int a[] = {1,7,3,9,5,6}; int b[] = {4,2,1,8,6,0}; printf(原数据为：\n数组a：[); for(i = 0; i 6; i++) { printf(%d , a[i]); append(x, a[i]); }/*next*/ printf(\b)\n数组b：[); for(i = 0; i 6; i++) { printf(%d , b[i]); append(y, b[i]); }/*next*/ printf(\b]\n转换为有序线性表\nA：); print(x); printf(B：); print(y); printf(AB合并后为：); merge(x, y); pr