c语言实现顺序表

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

typedef struct Vector {
	int *data;
	int size; //总大小 
	int length;	//现大小 
} Vector;

Vector *init(int n) {
	Vector *vec = (Vector *)malloc(sizeof(Vector));
	vec->data = (int *)malloc(sizeof(int) * n);
	vec->size = n;
	vec->length = 0;
	return vec;
}

int expand(Vector *vec) {
	int extr_size = vec->size;
	int *p;
	while(extr_size) {
		p = (int *)realloc(vec->data,sizeof(int) * (vec->size + extr_size));
		if(p)break;
		extr_size /= 2;
	}
	if(extr_size == 0) return 0;
	vec->data = p;
	vec->size += extr_size;
	return 1;
}

int insert(Vector *vec, int ind, int val) {
	if(vec == NULL) return 0;
	if(ind < 0 || ind > vec->length) return 0;
	if(vec->length == vec->size) {
		if(!expand(vec)) return 0;
		printf("success to expand ! the Vector size is %d\n",vec->size);
	}
	for(int i = vec->length; i > ind; i--) {
		vec->data[i] = vec->data[i-1];
	}
	vec->data[ind] = val;
	vec->length += 1;
	return 1;
}

int erase(Vector *vec, int ind) {
	if(vec == NULL) return 0 ;
	if(ind < 0 || ind >= vec->length) return 0;
	for(int i = ind + 1; i < vec->length; i++) {
		vec->data[i - 1] = vec->data[i];
	}
	vec->length -= 1;
	return 1;
}

void output(Vector *vec) {
	printf("Vector : [");
	for(int i = 0; i < vec->length; i++) {
		i && printf(", ");
		printf("%d", vec->data[i]);
	}
	printf("]\n");
	return ;
}

void clear(Vector *vec) {
	free(vec->data);
	free(vec);
	return ;
}

int main() {
	srand(time(0));
	#define max_op 40
	Vector *vec = init(5);
	for(int i = 0; i < max_op; i++) {
		int op = rand() % 4;
		int ind = rand() % (vec->length + 3) - 1;
		int val = rand() % 100;
		switch(op) {
			case 1:
			case 2:
			case 0: {
				printf("insert %d at %d to Vector = %d\n", val, ind, insert(vec, ind, val));
				break;
			}
			case 3: {
				printf("erase a iterm at %d from Vector = %d\n", ind, erase(vec,ind));
				break;
			}

		}
		output(vec);
		printf("\n");

	}
	clear(vec);
	#undef max_op
	return 0;
}