顺序表头文件1（Sequential header file 1）.doc

顺序表头文件1（Sequential header file 1） Order / header file 1.h / / the order of the linear form that refers to: a set of contiguous memory storage unit in order of the linear table data elements. As long as the initial position / storage of linear list, any linear data table elements are random access, / / so the order of the linear form table storage structure is a storage structure for random access. #define OVERFLOW -1 //----- linear table storage structure in order, dynamic allocation The initial allocation of #define LIST_INIT_SIZE 100 / / linear table storage space The distribution of incremental #define LISTINCREMENT 10 / / linear table storage space Typedef struct {ElemType *elem; / / storage space base Int length; / / current length Int listsize; / / the current storage capacity allocation (sizeof (ElemType) as a unit) }SqList; //1. initializes the empty table Status InitList_Sq (SqList L) {// constructs an empty linear form L L.elem= (ElemType *) malloc (LIST_INIT_SIZE, *sizeof (ElemType)); If (L.elem!) exit (OVERFLOW); / / memory allocation failure L.length=0; / / empty table length is 0 L.listsize=LIST_INIT_SIZE; / / initial storage capacity Return OK; }//InitList_Sq Void Creat_Sq (SqList L) {//2. to establish the order table L Int i; ElemType e; Cout enter the length of the sequence table:; cinL.length; If (L.lengthLIST_INIT_SIZE) L.elem= (ElemType *) realloc (L.elem, L.length*sizeof (ElemType)); Cout enter data.:; For (i=0; i=L.length-1; i++) {input (E); L.elem[i]=e;} } //3. destroy linear table Status DestoryList_Sq (SqList L) {// destroy linear table L If (L.elem) {free (L.elem); L.elem=NULL; L.length=L.listsize=0; return OK;} Return ERROR; } //4. resets the empty table Status ClearList_Sq (SqList L) {// reset L to the empty table L.length=0; Return OK; } //5. determines whether the table is empty or not Status ListEmpty_Sq (SqList L) {// determines whether or not the empty table, if the L is empty, it returns TRUE, otherwise it returns FALSE If (L.length