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

数据结构实验报告实验目的1. 熟练掌握线性表的顺序存储结构、链式存储结构，并分别实现线性表的基本操作。2. 熟练掌握顺序存储结构中算法的实现。3. 培养编程和上机调试能力。实验内容1. 建立含有若干元素的顺序表，并实现插入、删除、修改、查找等基本操作。并在屏幕上输出。2. 建立含有若干元素的链式表，并实现插入、删除、修改、查找等基本操作。并在屏幕上输出。实验步骤打开VC6.0，新建文件。编写代码，运行、调试、输出结果。实验代码顺序表#include #define elemtype intconst int maxsize=1000;class sequenlistprotected:elemtype amaxsize;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=maxsize-1)coutoverflowendl;else if(ilen+1)coutposition is not correct!=i;j-)aj+1=aj;ai=x;len+;void deletel(int i)int j;if(ilen)coutposition is not correct!endl;elsefor(j=i+1;j=len;j+)aj-1=aj;len-;int locate(elemtype x)int j=1;while(j=len)&(aj!=x)j+;if(j=len)return j;elsereturn 0;void change(elemtype x,elemtype y)int j;for(j=1;j=len;j+)if(aj=x)aj=y;void main()sequenlist L;elemtype x,y;int n,j;L.setnull();coutn;cout请输入n个元素，建立顺序表endl;L.input(n);L.print();L.length;coutxj;L.insert(x,j);L.print();coutj;L.deletel(j);L.print();L.length;coutx;j=L.locate(x);if(j!=0)coutx在第j个位置;else cout找不到;coutendl;L.print();coutx;couty;L.change(x,y);L.print();链式表：#include #define elemtype intclass linkpublic:elemtype data;link *next;class linklistprotected:link *head;public:link *hcreat()link *s,*p;elemtype i;couti;p=new link;p-next=NULL;while(i)s=new link;s-data=i;s-next=p-next;p-next=s;cini;return p;void print (link *head)link *p;p=head-next;while(p-next!=NULL)coutdata;p=p-next;coutdata;coutnext;while(p!=NULL)&(p-data!=x)p=p-next;return p;void deletel(link *head,elemtype x)link *p,*q;q=head;p=head-next;while(p!=NULL)&(p-data!=x)q=p;p=p-next;if(p=NULL)coutnext=p-next;delete(p);void insert(link *head,elemtype x,elemtype y)link *p,*s;s=new link;s-data=y;if(head-next=NULL)head-next=s;s-next=NULL;p=Locate(head,x);if(p=NULL)coutnext=p-next;p-next=s;void change(link *p,elemtype x,elemtype y)link *q;q=p-next;while(q!=NULL)if(q-data=x)q-data=y;q=q-next;int count(link *h)link *p;int n=0;p=h-next;while(p!=NULL)n+;p=p-next;return n;void main()int n;elemtype x,y;link *p,*q;linklist a;p=a.hcreat();a.print(p);couty;a.deletel(p,y);a.print(p);coutx;couty;a.insert(p,x,y);a.print(p);coutxy;a.change(p,x,y);a.print(p)