数据结构顺序存储结构C++实现

1、.PAGE . 数据构造实验报告实验目的熟练掌握线性表的顺序存储构造、链式存储构造，并分别实现线性表的根本操作。熟练掌握顺序存储构造中算法的实现。培养编程和上机调试能力。实验容建立含有假设干元素的顺序表，并实现插入、删除、修改、查找等根本操作。并在屏幕上输出。建立含有假设干元素的链式表，并实现插入、删除、修改、查找等根本操作。并在屏幕上输出。实验步骤翻开VC6.0，新建文件。编写代码，运行、调试、输出结果。实验代码顺序表#include #define elemtype intconst int ma*size=1000;class sequenlistprotected:elemtype a

2、ma*size;int len;public:void setnull()len=0;void input(int n)for(int j=1;jaj;len=n;void print()for(int i=1;i=len;i+)coutai ;coutendl;void length() cout现表长度len=ma*size-1)coutoverflowendl;else if(ilen+1)coutposition is not correct!=i;j-)aj+1=aj;ai=*;len+;void deletel(int i)int j;if(ilen)coutposition is

3、 not correct!endl;elsefor(j=i+1;j=len;j+)aj-1=aj;len-;int locate(elemtype *)int j=1;while(j=len)&(aj!=*)j+;if(j=len)return j;elsereturn 0;void change(elemtype *,elemtype y)int j;for(j=1;j=len;j+)if(aj=*)aj=y;void main()sequenlist L;elemtype *,y;int n,j;L.setnull();coutn;cout请输入n个元素，建立顺序表endl;L.input

4、(n);L.print();L.length;cout*j;L.insert(*,j);L.print();coutj;L.deletel(j);L.print();L.length;cout*;j=L.locate(*);if(j!=0)cout*在第j个位置;else cout找不到;coutendl;L.print();cout*;couty;L.change(*,y);L.print();链式表：#include #define elemtype intclass linkpublic:elemtype data;link *ne*t;class linklistprotected:l

5、ink *head;public:link *hcreat()link *s,*p;elemtype i;couti;p=new link;p-ne*t=NULL;while(i)s=new link;s-data=i;s-ne*t=p-ne*t;p-ne*t=s;cini;return p;void print (link *head)link *p;p=head-ne*t;while(p-ne*t!=NULL)coutdata;p=p-ne*t;coutdata;coutne*t;while(p!=NULL)&(p-data!=*)p=p-ne*t;return p;void delete

6、l(link *head,elemtype *)link *p,*q;q=head;p=head-ne*t;while(p!=NULL)&(p-data!=*)q=p;p=p-ne*t;if(p=NULL)coutne*t=p-ne*t;delete(p);void insert(link *head,elemtype *,elemtype y)link *p,*s;s=new link;s-data=y;if(head-ne*t=NULL)head-ne*t=s;s-ne*t=NULL;p=Locate(head,*);if(p=NULL)coutne*t=p-ne*t;p-ne*t=s;v

7、oid change(link *p,elemtype *,elemtype y)link *q;q=p-ne*t;while(q!=NULL)if(q-data=*)q-data=y;q=q-ne*t;int count(link *h)link *p;int n=0;p=h-ne*t;while(p!=NULL)n+;p=p-ne*t;return n;void main()int n;elemtype *,y;link *p,*q;linklist a;p=a.hcreat();a.print(p);couty;a.deletel(p,y);a.print(p);cout*;couty;a.insert(p,*,y);a.print(p);cout*y;a.change(p,*,y);a.print(p)