데이터 구조 - 선형 표 의 수립 과 질서 있 는 출력

#include
#include
# define LIST_INIT_SIZE 100
# define LISTINCREMENT 10
# define ElemType int
# define OVERFLOW -1
# define ERROR -1
using namespace std;
typedef struct {
    ElemType *elem;
    int length;
    int listsize;
}SqList;
void InitList_Sq(SqList &L)
{
    L.elem = (ElemType * )malloc(LIST_INIT_SIZE*sizeof(ElemType));
    if(! L.elem)
        exit(OVERFLOW);
    L.length = 0;
    L.listsize = LIST_INIT_SIZE;
}
int ListInsert_Sq(SqList &L, int i, ElemType e)
{

    if(i > L.length)
    {
        cout << "ERROR";
        return ERROR;
    }
    if(L.length >= L.listsize)
    {
        ElemType *newbase;
        newbase = (ElemType *)realloc(L.elem,(L.listsize + LISTINCREMENT) * sizeof(ElemType));
        if(!newbase)
        exit(OVERFLOW);
        L.elem = newbase;
        L.listsize += LISTINCREMENT;
    }

    if(L.length == 0)
    {
        L.elem[0] = e;
        L.length++;
        return 1;
    }
    else
    {
        ElemType *p, *q;
        int wh;
        for(wh = 0; wh < L.length; wh++)
        {
            if( L.elem[wh] > e)
                break;
        }
        q = &L.elem[wh];
        for( p = &(L.elem[L.length-1]); p >= q; p--)
            *(p+1) = *p;
         *q = e;
        L.length++;
    }
}
int main ()
{
    SqList L;
    InitList_Sq(L);
    int e;
    int n;
    cout << "Please input n:" << endl;
    cin >> n;
    cout << "Please input elem:" << endl;
    for(int i = 0; i < n; i++)
    {
        cin >> e;
        ListInsert_Sq( L, i, e);
    }
    cout << "Output the SqList:" << endl;
    for(int i = 0; i < L.length; i++)
        cout << L.elem[i] << " ";
    cout << endl;
    free(L.elem);
    L.elem = NULL;
}