静态创建顺序表，并进行插入删除操作

程序代码：

#include"stdio.h"#include<iostream>#include"stdlib.h"using namespace std;#define maxsize 10void insertelem(int sqlist[], int &n, int i, int item)//向长度为n的静态顺序表的第i个位置处插入元素item{    if (n == maxsize || i<1 || i>n + 1)//插入非法    {        cout << "插入非法" << endl;        return;    }    int* q = &sqlist[n - 1];    for (;q >= &sqlist[i - 1]; q--)//将第i个位置及其后面所有的元素向后移动一位        *(q + 1) = *q;    sqlist[i - 1] = item;    n++;//顺序表长度加1}void deleteelem(int sqlist[], int &n, int i)//将长度为n的静态顺序表的第i个位置处元素删除{    if (i<1 || i>n)//删除非法        return;    for (int j = i; j < n; j++)//从第i个位置后的元素依次往前移动一位        sqlist[j - 1] = sqlist[j];    n--;//顺序表长度减1}int main(){    int sqlist[maxsize];    int len;    printf("please input six integer number:\n");    for (int i = 0; i < 6; i++)        cin >> sqlist[i];    len = 6;    for (int i = 0; i < len; i++)        printf("%d ", sqlist[i]);    printf("\nThe spare length is%d\n", maxsize - len);    //插入元素    insertelem(sqlist, len, 3, 0);    for (int i = 0; i < len; i++)        printf("%d ", sqlist[i]);    printf("\nThe spare length is%d\n", maxsize - len);    //非法插入    insertelem(sqlist, len, 11, 0);    //删除元素    deleteelem(sqlist, len, 6);    for (int i = 0; i < len; i++)        printf("%d ", sqlist[i]);    printf("\nThe spare length is%d\n", maxsize - len);    system("pause");    return 0;}

运行结果：