顺序表的实现.docVIP

顺序表的实现 /************************************ c1.h (程序名) *********************************************/ #include string.h #include ctype.h #include malloc.h //malloc()等 #include limits.h //INT_MAX等 #include stdio.h //EOF(=^Z或F6), NULL #include stdlib.h //atoi() #include io.h //eof() #include math.h //floor(), ceil(), abs() #include process.h //exit() #include iostream.h //cout, cin //函数结果状态代码 #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 //#define OVERFLOW -2 //因为在math.h中已经定义了 OVERFLOW的值为3，故去掉此行 typedef int Status; //Status是函数的类型，其值是函数结果状态代码，如OK等 typedef int Boolean; //Boolean是布尔类型，其值是TRUE或FALSE typedef int ElemType; #define LIST_INIT_SIZE 100 //线性表初始化的量 #define LIST_INCREMENT 10 //线性表存储空间的增量 //-----------------------------------------顺序表 typedef struct SqList { ElemType *elem; int length; int listsize; }SqList; //---------------------------------------基本操作 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); }//InitList Status DestroyList (SqList L) {//删除顺序表 free (L.elem); L.elem = NULL; L.length = 0; L.listsize = 0; return (OK); }//DestroyList void ClearList (SqList L) {//清空文件夹 L.length = 0; } Status ListEmpty (SqList L) { if (L.length == 0) return (TRUE); else return (FALSE); } Status ListLength (SqList L) { return (L.length); } Status GetElem (SqList L, int i, ElemType e) {//求得顺序表中的第i个元素赋值给e if (L.length-1 i || i 1) return (ERROR); e = *(L.elem+i-1); return (OK); } int LocateElem (SqList L, ElemType e, Status(*compare)(ElemType, ElemType)) {//初始条件：线性表L已经存在compare函数是数据元素的判定函数 //操作结果：返回L中第一个满足compare的位序，若这样的元素不存在，则返回0 int i = 1; ElemType *p; p = L.elem; while (!(compare (*p++, e)) i = L.length) { ++i; } if (i L.length) return (0); else return (i); }//LocateElem Status PriorElem (SqList L, ElemType cur_e,