Code implementation of sequence table

Code implementation of sequence table

//  The order sheet .cpp :  This file contains  "main"  function . Program execution will start and end here .
#include <iostream>
using namespace std;

#define OK 1
#define ERROR 0
#define MAXSIZE 20
#define TRUE 1
#define FALSE 0

typedef int Status;
typedef int ElemType;

typedef struct {
    
	ElemType data[MAXSIZE];
	int length;
}SqList;
Status InitList(SqList* L)
{
    
	if (L == NULL)return ERROR;
	L->length = 0;
	return OK;
}
Status ClearList(SqList* L)
{
    
	if (L == NULL)return ERROR;
	L->length = 0;
	return OK;
}
Status isListEmpty(SqList* L)
{
    
	if (L == NULL)return TRUE;
	if (L->length == 0)return TRUE;
	return ERROR;
}
int ListLength(SqList* L)
{
    
	return L->length;
}
Status ListInsert(SqList* L, int index, const ElemType e)
{
    
	if ((index >= 1) && (L->length < MAXSIZE))
	{
    
		if (index <= L->length)
		{
    
			for (int k = L->length - 1; k >= index - 1; k--)
				L->data[k + 1] = L->data[k];
		}
		L->data[index - 1] = e;
		L->length++;
		return OK;
	}
	return ERROR;
}
Status ListDelete(SqList* L,int index,ElemType* e)
{
    
	if (L->length == 0)return ERROR;
	if (index<1 || index>L->length)return ERROR;
	*e = L->data[index - 1];
	if (index < L->length) {
    
		for(int k=index;k<L->length;k++)
			L->data[k - 1] = L->data[k];
		L->length--;
		return OK;
	}
}
Status visit(ElemType e)
{
    
	printf("%d->", e);
	return OK;
}
Status ListTraverse(SqList* L)
{
    
	for (int i = 0; i < L->length; i++)
		visit(L->data[i]);
	printf("\r\n");
	return OK;
}
Status GetElem(SqList* L, int index, ElemType* e)
{
    
	if (L->length == 0 || index<1 || index>L->length)
		return ERROR;
	*e = L->data[index - 1];
	return OK;
}
int main()
{
    
	SqList L;
	ElemType e;
	Status ret;
	int j, k;
	ret = InitList(&L);
	printf(" initialization L after :L.length=%d\n", L.length);
	for (j = 1; j <= 5; j++)
		ret = ListInsert(&L, 1, j);
	ListTraverse(&L);
	ret = isListEmpty(&L);
	printf("L Is it empty :%d(1: empty  0: no )\n", ret);
	ClearList(&L);
	ret = isListEmpty(&L);
	printf("L Is it empty %d(1: empty  0: no )\n", ret);
	for (j = 1; j <= 10; j++)
		ret = ListInsert(&L, 1, j);
	ListTraverse(&L);
	ListInsert(&L, 1, 0);
	ListTraverse(&L);
	GetElem(&L, 5, &e);
	printf(" The fifth element is %d\n", e);
	k = ListLength(&L);
	for (j = k + 1; j >= k; j--) {
    
		ret = ListDelete(&L, j, &e);
		if (ret == ERROR)
			printf(" Delete the first %d Data failed \n", j);
		else
			printf(" Delete the first %d Data success :%d\n", j, e);
	}
	ListTraverse(&L);
	ListDelete(&L, 5, &e);
	printf(" Delete the first %d Data success ;%d\n", 5, e);
	return 0;
}