C语言的线性表之顺序表你了解吗

#include <stdlib.h>
#include <assert.h>
#define MAX_SIZE 1000 //顺序表能储存的最大数值
typedef int DATA;   //抽象化int类型
typedef struct _List{
    DATA *data;
    int length;
} SeqList;

//初始化顺序表
SeqList* initList() {
    SeqList* list = malloc(sizeof(SeqList));
  	assert(list != NULL);
    list->data = malloc(MAX_SIZE * sizeof(DATA));
    list->length = 0;  //顺序表的初始长度为0
    assert(list->data != NULL);
    return list;
}

void insertByHead(SeqList* list, DATA data){
    if (list->length >= MAX_SIZE){
        printf("顺序表已满无法插入数据...\n");
        return; //跳出函数
    }
    for (int i = list->length; i > 0; i--){
        list->data[i] = list->data[i-1];
    }
    list->data[0] = data;
    list->length++;
}

void insertByIndex(SeqList* list, int index, DATA data){
    if ((index < 0 || index >= list->length) && list->length >= MAX_SIZE){
        printf("输入的index值错误或顺序表已满无法插入...\n");
        return; //跳出函数
    }
    for (int i = list->length; i > index; i--) {
	    list->data[i] = list->data[i - 1];
    }
    list->data[index] = data;
    list->length++;
}

void insertByTail(SeqList* list, DATA data){    if (list->length >= MAX_SIZE){        printf("顺序表已满无法插入数据...\n");        return; //跳出函数    }    list->data[list->length++] = data;}void insertByTail(SeqList* list, DATA data){
    if (list->length >= MAX_SIZE){
        printf("顺序表已满无法插入数据...\n");
        return; //跳出函数
    }
    list->data[list->length++] = data;
}

int find(SeqList* list, DATA data)
{
	for (int i = 0; i < list->length; i++) {
		if (list->data[i] == data) {
			return i;
		}
	}
	return -1;
}

void deleteByData(SeqList* list, DATA data) {
	if (list->length == 0){
      	printf("表为空，无需进行删除...\n");
    }
	int ret = find(list, data);
	if (ret != -1) {
		for (int i = ret; i < list->length - 1; i++) {
			list->data[i] = list->data[i + 1];
		}
		list->length--;
	}
  	else{
    	printf("该数据不存在，无法删除...\n");
  	}
}

void deleteByIndex(SeqList* list, int index) {
	if (list->length == 0){
      	printf("表为空，无需进行删除...\n");
    }
  	if (index >= list->length){
    	printf("索引位置大于表的总长度...\n");
      	return;
  	}
	for (int i = index; i < list->length - 1; i++) {
		list->data[i] = list->data[i + 1];
	}
	list->length--;
}