顺序表的实现

#include <stdio.h>
#include <stdlib.h>

#define ERROR 0
#define OK 1

typedef struct Vector {
    int length,size;
    int *data;
} Vector;
//建立顺序表节点

void init(Vector *vector, int size) {
    vector->length = 0;
    vector->size = size;
    vector->data = (int *)malloc(sizeof(int) * vector->size);
}
//建立size个单位的顺序表vector

void expand(Vector *vector) {
    int *old_data = vector->data;
    vector->size = 2 * vector->size;
    vector->data = (int *)malloc(sizeof(int) * vector->size) ;
    for(int i = 0; i <= vector->length; i++){
        vector->data[i] = old_data[i];
    }
    free(old_data);
}
//顺序表大小翻倍

int insert(Vector *vector, int loc, int data) {
    if(loc < 0 || loc > vector->length){
        printf("failed\n");
        return ERROR;
    }
    if(vector->length > vector->size){
        expand(vector);
    }
    for(int i = vector->length; i > loc; i--){
        vector->data[i] =vector->data[i-1]; 
    }
    vector->data[loc] = data;
	vector->length++;
    printf("success\n");
    return OK;
}
//插入操作

int search(Vector *vector, int value) {
    for(int i = 0; i < vector->length; i++){
        if(vector->data[i] == value){
            printf("success\n");
            return i;
        }
    }
    printf("failed\n");
    return -1;
}
//在顺序表中搜索value

int delete_node(Vector *vector, int index) {
    if(index < 0 || index >= vector->length){
        printf("failed\n");
        return ERROR;
    }
    for(int i = index+1; i < vector->length; i++){
        vector->data[i-1] = vector->data[i];
    }
    vector->length--;
    printf("success\n");
    return OK;
}
//删除顺序表中第index个元素

void print(Vector *vector) {
    printf("%d", vector->data[0]);
    for(int i = 1; i < vector->length; i++){
        printf(" %d", vector->data[i]);
    }
    printf("\n");
}
//输出顺序表中所有元素

void clear(Vector *vector) {
    free(vector->data);
    free(vector);
}
//顺序表使用结束后清理内存

void s(Vector *a, int m){
    int x, y, t;
    for(int i = 0; i < m; i++){
        scanf("%d", &t);
        switch(t){
            case 1: scanf("%d%d", &x, &y);insert(a,x,y);break;
            case 2: scanf("%d", &x);delete_node(a,x);break;
            case 3: scanf("%d", &x);search(a,x);break;
            case 4: print(a);break;
        }
    }
    
}
//设置的输出函数，执行m次操作

int main() {
    Vector *a = (Vector *)malloc(sizeof(Vector));
    init(a, 20);
    int m = 0;
    scanf("%d", &m);
    s(a,m);
    
    
    
    return 0;
}

 菜鸟，欢迎大佬斧正。