线性 表 (50分)

#include<stdio.h>
#include<malloc.h>
#define NULL 0
#define FALSE 0
#define ERROR 0
#define TRUE 1
#define OK 1
#define size 20
#define ElemType char
#define LISTNCREMENT 5
#define OVERFLOW 0

typedef struct SList
{ int length;
int listsize;
ElemType *elem;

}SList;
SListInit(SList &amp;L)
{L.elem =(ElemType *)malloc( size*sizeof(ElemType));
if(!L.elem) return NULL;
L.length = 0;
L.listsize=size;
return OK;
}
SListInsert(SList &amp;L,int i,ElemType e)
{int j;
if(! L.elem ||i<1||i>L.length ) return ERROR;
for(j=L.length;j>i;j--)
L.elem[j]=L.elem[j-1];
L.elem[j-1]=e;
L.length++;
return TRUE;
}