数据结构C语言实现顺序表的插入和删除代码.doc

#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_MAX_LENGTH 10#define LIST_INIT_SIZE 10#define LISTINCREMENT 2typedef struct int *elem; int length; int listsize; SqList; SqList L; typedef int Status; Status InitList_Sq(SqList *L) L-elem=(int *)malloc(LIST_MAX_LENGTH*sizeof(int); if(!L-elem) exit(OVERFLOW); L-length=0; L-listsize=LIST_INIT_SIZE; return OK; Status CreateList_Sq(SqList *L,int n) int i; L-length=n; printf(Please In Put Numbers:n); for(i=0;ielemi); printf(The List Is:); for(i=0;ielemi); printf(n); Status InsertList_Sq(SqList *L) int i,m; int *p; int *q; printf(Please In Put The Location:n); scanf(%d,&i); printf(Please In Put The Number To Insert:n); scanf(%d,&m); p=&(L-elemi-1); for(q=L-elem+L-length-1;plength; printf(The New List Is:n); for(p=L-elem;pelem+L-length-1;p+) printf(%-4d,*p); printf(n); return OK;Status ListDelete_Sq(SqList *L) int i; int e; int *p; int *q; printf(Please In Put The Location To Delete:n); scanf(%d,&i); p=&(L-elemi-1); e=*p; q=L-elem+L-length-1; for(+p;plength; printf(The Delete Number Is %dn,e); printf(The New List Is:n); for(p=L-elem;pelem+L-length-1;p+) printf(%-4d,*p); printf(n); return OK; main() int n,i; InitList_Sq(&L); printf(Please In Put Length:n); scanf(%d,&n); CreateList