通过数据结构实现对数组的一般操作

代码：

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

struct Arr
{
    int *pBase;
    int len;
    int cnt;
};

void init_arr(struct Arr *, int);
bool append_arr(struct Arr *, int);
bool insert_arr(struct Arr *, int, int);
bool delete_arr(struct Arr *, int, int *);
int get();
bool is_empty(struct Arr *);
bool is_full(struct Arr *);
void sort_arr(struct Arr *);
void show_arr(struct Arr *);
void reverse_arr(struct Arr *);

int main(void) {

	struct Arr arr;
	int val;
	
	init_arr(&arr, 6);
	show_arr(&arr);
	append_arr(&arr, 1);
	append_arr(&arr, 10);
	append_arr(&arr, -3);
	append_arr(&arr, 6);
	append_arr(&arr, 88);
	append_arr(&arr, 11);
	if ( delete_arr(&arr, 4, &val) )
	{
		printf("删除成功!\n");
		printf("您删除的元素是: %d\n", val);
	}
	else
	{
		printf("删除失败!\n");
	}
/*	append_arr(&arr, 2);
	append_arr(&arr, 3);
	append_arr(&arr, 4);
	append_arr(&arr, 5);
	insert_arr(&arr, -1, 99);
	append_arr(&arr, 6);
	append_arr(&arr, 7);
	if ( append_arr(&arr, 8) )
	{
		printf("追加成功\n");
	}
	else
	{
		printf("追加失败!\n");
	}
*/	
	show_arr(&arr);
	reverse_arr(&arr);
	printf("倒置之后的数组内容是:\n");
	show_arr(&arr);
	sort_arr(&arr);
	show_arr(&arr);

	//printf("%d\n", arr.len);

    return 0;
}

void init_arr(struct Arr *pArr, int length) {
    pArr->pBase = (int *)malloc(sizeof(int) * length);
    if (NULL == pArr->pBase) {
        printf("动态内存分配失败!\n");
        exit(-1);
    }
    pArr->len = length;
    pArr->cnt = 0;

    return;
}

bool is_empty(struct Arr *pArr) {
    if (pArr->cnt == 0) {
        return true;
    }
    else
    {
        return false;
    }   
}

bool is_full(struct Arr * pArr) {
    if ((*pArr).cnt == pArr->len) {
        return true;
    }
    else {
        return false;
    }
}

void show_arr(struct Arr *pArr) {
    if (is_empty(pArr)) {
        printf("数组为空！\n");
    }
    else
    {
        for (int i = 0; i < pArr->cnt; ++i) {
            printf("%d  ", pArr->pBase[i]);
        }
        printf("\n");
    }
    return;
}

bool append_arr(struct Arr *pArr, int val) {
    if (is_full(pArr)) {
        return false;
    }
    pArr->pBase[pArr->cnt] = val;
    pArr->cnt++;
    return true;
}

bool insert_arr(struct Arr *pArr, int pos, int val) {
    if (is_full(pArr)) {
        return false;
    }
    if (pos < 1 || pos > pArr->cnt+1) {
        return false;
    }
    for (int i = pArr->cnt - 1; i >= pos - 1; --i) {
        pArr->pBase[i + 1] = pArr->pBase[i];
    }
    pArr->pBase[pos - 1] = val;
    pArr->cnt++;
    return true;
}

bool delete_arr(struct Arr *pArr, int pos, int *pVal) {
    if (is_empty(pArr)) {
        return false;
    }
    if (pos < 1 || pos > pArr->len) {
        return false;
    }
    *pVal = pArr->pBase[pos - 1];
    for (int i = pos - 1; i <pArr-> cnt - 1; ++i) {
        pArr->pBase[i] = pArr->pBase[i + 1];
    }
    pArr->cnt--;
    return true;
}

void reverse_arr(struct Arr *pArr) {
    int i = 0;
    int j = pArr->cnt - 1;
    int t;
    while (i<j)
    {
        t = pArr->pBase[i];
        pArr->pBase[i] = pArr->pBase[j];
        pArr->pBase[j] = t;
        ++i;
        --j;
    }
    return;
}

void sort_arr(struct Arr *pArr) {
    int t;
    for (int i = 0; i < pArr->cnt; ++i)
    {
        for (int j = i + 1; j < pArr->cnt; ++j)
        {
            if (pArr->pBase[i] > pArr->pBase[j]) {
                t = pArr->pBase[i];
                pArr->pBase[i] = pArr->pBase[j];
                pArr->pBase[j] = t;
            }
        }
    }
    return;
}