C语言数据结构基本操作..docVIP

/*顺序表的基本操作*/ #include stdio.h #include conio.h #include iostream.h #include stdlib.h #define Length 10 #define LISTINCREMENT 3 #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR -1 #define OVERFLOW -2 typedef int Status; typedef int ElemType; typedef struct lineorder{ int *elem; int length; int listsize; }SqList; Status initlist_Sq(SqList L) /*初始化顺序表*/ { L.elem=(ElemType*)malloc(sizeof(ElemType)*Length); if(!L.elem) exit(OVERFLOW); L.listsize=Length; L.length=0; return OK; } void destroylist(SqList c) /*销毁顺序表*/ { free(c.elem); c.elem=NULL; c.length=0; } void clearlist_Sq(SqList c) /*清空顺序表*/ { c.length=0; } Status listempty_Sq(SqList c) /*测试顺序表是否为空*/ { if(c.length!=0) return(FALSE); return(TRUE); } Status ListInsert_Sq(SqList L, int i,ElemType e) /*在第i个位置上插入一个元素*/ { int j,*newbase; if (i1 || iL.length+1) return ERROR; if (L.length = L.listsize){ newbase=(ElemType *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType)); if (!newbase) exit(OVERFLOW); L.elem=newbase; L.listsize+=LISTINCREMENT; } for (j=L.length ; j=i ; --j) L.elem[j]=L.elem[j-1]; L.elem[j]=e ; ++L.length ; return OK; } int LocateElem_Sq(SqList L,ElemType e) /*返回元素e在顺序表中的位置*/ { int i=1; ElemType *p=L.elem; while(i=L.length !(*p==e)) {i++; p++;} if(i=L.length) return i; return FALSE; } Status ListDelete_Sq(SqList L , int i , int e) /*删除第i个位置上的元素*/ { int j; if(i1 || iL.length) return ERROR; e=L.elem[i-1]; for( j=i; jL.length;j++) L.elem[j-1]=L.elem[j]; L.length--; return OK; } void Print_Sq(SqList L) /*输出顺序表*/ { int i; if (listempty_Sq(L)) printf(\nSequential Lists length is %d. Its empty!,L.length); else printf(\nSequential Lists length is %d. These element are : ,L.length); for(i=0;iL.length;i++) printf( %d,L.elem[i]); } void menu() { printf(\n); printf(\n* * * * * * * * * * * * * * * * * * * * * * * * * *\n); printf(