妙趣横生的算法实例1-1

下面是我写的答案：

#include <stdio.h>


#define MaxSize 10
int Sqlist[MaxSize];
int len = 0;


void show(int length)
{
int i = 0;
int tmp = length;


while(tmp > 0)
{
printf("%d ", Sqlist[i]);
i++;
tmp--;
}
printf("\n");
printf("表中剩余的空间个数为：%d \n", MaxSize - length);
}


void InsertElem(int Sqlist[], int *length, int i, int item)
{
int t;
if(*length == MaxSize || i < 1 || i > *length + 1)
{
printf("非法插入\n");
return;
}


for(t = *length - 1; t >= i - 1; t--)
{
Sqlist[t + 1] = Sqlist[t];
}


Sqlist[i - 1] = item;
*length = *length + 1;
}


void DelElem(int Sqlist[], int *length, int i)
{
int j = 0;
if(i < 1 || i > *length)
{
printf("非法删除\n");
return;
}

for(j = i -1; j < *length - 1; j++)
{
Sqlist[j] = Sqlist[j + 1];
}
*length = *length - 1;
}


void main()
{
int i = 6;
printf("请输入 %d 个整数\n", i);
while(i > 0)
{
scanf("%d", &Sqlist[len]);
i--;
len++;
}


printf("刚才输入的整数为：\n");
show(len);


InsertElem(Sqlist, &len, 11, 0);
show(len);


DelElem(Sqlist, &len, 6);
show(len);
}