Static linked list

#include <stdio.h>

#define MAXSIZE 20

typedef int T;
typedef struct
{
    
	T data;
	int cur;
}StaticList[MAXSIZE];

int LengthList(StaticList L)// The number of data 
{
    
	int i = 0;
	int j = L[MAXSIZE - 1].cur;
	while (i)
	{
    
		i = L[i].cur;
		j++;
	}
	return j;
}

bool InitStList(StaticList space)
{
    
	for (int i = 0; i < MAXSIZE; i++)
		space[i].cur = i + 1;
	space[MAXSIZE - 1].cur = 0;
	return true;
}

int Malloc(StaticList space)// If the spare space linked list is not empty , Then the allocated node subscript is returned 
{
    
	int i = space[0].cur;
	if (space[0].cur)
		space[0].cur = space[i].cur;
	return i;
}

void Free(StaticList space, int k)// Mark the subscript as k The idle nodes are recycled to the spare list 
{
    
	space[k].cur = space[0].cur;
	space[0].cur = k;
}

bool InterList(StaticList L, int i,T val)// stay L pass the civil examinations i Insert a new data element before an element 
{
    
	int j, k, l;
	T e;
	k = MAXSIZE - 1;
	if (i<i || i>LengthList(L) + 1)
		return false;
	j = Malloc(L);
	if (j)
	{
    
		L[j].data = val;
		for (l = 1; l <= i - 1; l++)
			k = L[k].cur;
		L[j].cur = L[k].cur;
		L[k].cur = j;
		return true;
	}
	return false;
}

void Show(StaticList L)// Traverse 
{
    
	int i = L[MAXSIZE - 1].cur;
	while (i)
	{
    
		printf("%d ", L[i].data);
		i = L[i].cur;
	}
	printf("\n");
}

bool DeleteList(StaticList L, int i)// Delete on L No i Data element 
{
    
	int j, k;
	if (i<1 || i>LengthList(L))
		return false;
	k = MAXSIZE - 1;
	for (j = 1; j <= i - 1; j++)
		k = L[k].cur;
	j = L[k].cur;
	L[k].cur = L[j].cur;
	Free(L, j);
	return true;
}
int main()
{
    
	return 0;
}

Give a link , You can see for yourself what you want to know