数据结构中顺序表的基本操作

/头文件#include#include #include/函数返回状态代码#define ok 1#define error 0#define true 1#define false 0#define infeasible -1#define overflow -2/运用动态分配的顺序存储结构#define list_init_size 100#define listincrement 10typedef int elemtype; typedef structelemtype *elem; int length;int listsize;sqlist;-可编辑修改 -typedef int status;status initlist(sqlist &l)/初始化一个顺序表l.elem=(elemtype *)malloc(list_init_size*sizeof(elemtype); if(!l.elem) exit(overflow);l.length=0;l.listsize=list_init_size; return ok;/initsqliststatus listinsert(sqlist &l,int i,elemtype e)/在第 i 个元素前插入一个新的元素if(i +l.length) return error; if(l.length=l.listsize)elemtype*newbase=(elemtype*)realloc(l.elem,(list_init_size+listincrement)*sizeof(elemtype); if(!newbase) exit(overflow);l.elem=newbase;l.listsize=list_init_size+listincrement;/勿忘for (int j=l.length; j=i; -j)/此处要注意l.elemj=l.elemj-1; l.elemi-1=e;return ok;/listinsertstatus getelem(sqlist l,int i,elemtype &e)/返回顺序表中的第i 个元素if(il.length) return error; e=l.elemi-1;return ok;/getelemstatus listdelete(sqlist &l,int i,elemtype &e)/删除顺序表中的第i 个元素if(il.length) return error;e=l.elemi-1; for(i;il.length;i+)l.elemi-1=l.elemi;-l.length; return ok;/listdeletestatus priorelem(sqlist l,elemtype cur_e,elemtype &pre_e)/返回一个不是首元素的前驱int i=2;if(cur_e=l.elem0) return error; while(i=l.length&(l.elemi-1!=cur_e)i+;if(i=l.length+1) return error; else pre_e=l.elemi-2;return ok;/priorelemstatus nextelem(sqlist l,elemtype cur_e,elemtype &next_e)/返回一个不是末元素的后继int i=1;while(il.length&(l.elemi-1!=cur_e) i+;if(i=l.length) return error; else next_e=l.elemi;return ok;/nextelemstatus listempty(sqlist l)/判断顺序表是否为空return l.length = 0;/listemptystatus listlength(sqlist l)/求顺序表的长度return l.length;/listlengthstatus destroylist(sqlist &l)/销毁一个顺序表if (l.elem)free(l.elem);l.elem=n