#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <stdbool.h>
struct Arr{
int cnt;
int len;
int *pBase;
};
void init_arr(struct Arr *pArr,int length);
void show_arr(struct Arr *);
bool is_empty(struct Arr *);
bool append_arr(struct Arr *,int);
bool is_full(struct Arr *);
bool insert_arr(struct Arr *,int position,int val);
bool delete_arr(struct Arr *,int pos,int *pVal);
void inversion_arr(struct Arr *pArr);
void sort_arr(struct Arr *);
int main(void)
{
struct Arr arr;
int val;
init_arr(&arr,6);
append_arr(&arr,1);
append_arr(&arr,-6);
append_arr(&arr,22);
append_arr(&arr,45);
append_arr(&arr,10);
printf("删除的元素是:%d\n",val);
show_arr(&arr);
inversion_arr(&arr);
printf("倒置之后的数组:\n");
show_arr(&arr);
sort_arr(&arr);
printf("排序之后的数组:\n");
show_arr(&arr);
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);
}else{
pArr->len = length;
pArr->cnt = 0;
}
return;
}
bool is_empty(struct Arr *pArr)
{
if(0 == pArr->cnt)
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
{
int i = 0;
for(;i<pArr->cnt;i++){
printf("%d\n",pArr->pBase[i]);
}
}
}
bool append_arr(struct Arr *pArr,int val)
{
if( is_full(pArr)){
printf("追加失败!\n");
return false;
}
else{
pArr->pBase[pArr->cnt] = val;
pArr->cnt++;
return true;
}
}
bool insert_arr(struct Arr *pArr,int position,int val)
{
int i;
if(is_full(pArr))
return false;
if(position<1 || position>pArr->cnt+1)
return false;
for(i=pArr->cnt-1;i>=position-1;i--){
pArr->pBase[i+1] = pArr->pBase[i];
}
pArr->pBase[position-1] = val;
pArr->cnt++;
return true;
}
bool delete_arr(struct Arr *pArr,int pos,int *pVal)
{
int i;
if(is_empty(pArr))
return false;
if(pos<1||pos>pArr->cnt)
return false;
*pVal = pArr->pBase[pos-1];
for(i=pos;i<pArr->cnt;i++){
pArr->pBase[i-1]=pArr->pBase[i];
}
pArr->cnt--;
return true;
}
void inversion_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 i,j,t;
for(i = 0;i<pArr->cnt;i++){
for(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;
}