有序表的创造插入清除扩展输出

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

typedef struct vector {
    int size, count;
    int* data;
} vector;

vector* getNewVector(int n) {
    vector* p = (vector*)malloc(sizeof(vector));
    p->size = n;
    p->count = 0;
    p->data = (int*)malloc(sizeof(int) * n);
    return p;
}

int expand(vector* v) {
    if (v == NULL) return 0;
    printf("expand v from %d to %d\n", v->size, 2 * v->size);
    int* p = (int*)realloc(v->data, sizeof(int) * 2 * v->size);
    if (p == NULL) return 0;
    v->data = p;
    v->size *= 2;
}

int insert(vector* v, int pos, int val) {
    if (pos < 0 || pos > v->count) return 0;
    if (v->size == v->count && !expand(v)) return 0;
    for (int i = v->count - 1; i >= pos; i--) {
        v->data[i + 1] = v->data[i];
    }
    v->data[pos] = val;
    v->count += 1;
}

int erase(vector* v, int pos) {
    if (pos < 0 || pos >= v->count) return 0;
    for (int i = pos ; i < v->count-1; i++) {
        v->data[i] = v->data[i+1];
    }
    v->count -= 1;
}

void output_vector(vector* v) {
    int len = 0;
    for (int i = 0; i < v->size; i++) {
        len += printf("%3d", i);
    }
    printf("\n");
    for (int i = 0; i < len; i++) printf("-");
    printf("\n");
    for (int i = 0; i < v->count; i++) {
        printf("%3d", v->data[i]);
    }
    printf("\n");
    printf("\n\n");
}

void clear(vector* v) {
    if (v == NULL) return;
    free(v->data);
    free(v);
}

int main() {
    srand(time(0));
#define MAX_OP 20
    vector* v = getNewVector(2);
    for (int i = 0; i < MAX_OP; i++) {
        int op = rand() % 4, pos, val, ret;
        switch (op) {
        case 0:
        case 1:
        case 2:
            pos = rand() % (v->count + 2);
            val = rand() % 100;
            ret = insert(v, pos, val);
            printf("insert %d at %d to vector = %d\n",
                val, pos, ret);
            break;
        case 3:
            pos = rand() % (v->count + 2);
            ret = erase(v, pos);
            printf("erase item at %d in vector = %d\n",
                pos, ret);
            break;
        }
        output_vector(v);
    }
    clear(v);
    return 0;
}