实现顺序表的基本操作（最终提交“.cpp”）



程序要求：



先给出顺序表的类型定义



给出顺序表的如下基本操作的算法函数定义



构造一个空的线性表：InitList_Sq(SqList &L)



在顺序表L的第i个位置之前插入新的元素e：ListInsert_Sq(SqList &L, int I, ElemType e)



在顺序表L中删除第i个元素，并用e返回其值：ListDelete_Sq(SqList &L, int I, ElemType &e)



实现如下新操作的函数定义：



借助ListInsert_Sq操作创建一个顺序表：ListCreate_Sq(?)



计算线性表的长度：ListLength_Sq(?)



打印顺序表中的所有元素值：ListPrint_Sq(?)



其中?请自行添加适宜的参数表



在主函数中调用上述函数进行测试，给出测试结果截图-To achieve the basic operation of the order form (the final submission　.Cpp )

Program requirements:

First, the definition of the type of the order table is given.

The algorithm function definition of the following basic operation of the order table is given.

Construct an empty linear list: InitList_Sq (&L SqList)

Insert the new element e:ListInsert_Sq (&L SqList, I int,, e ElemType, L) before the first I of the sequence table.

Removes the first I element in the sequence table L and returns its value with ListDelete_Sq: e (&L SqList, I int, &e ElemType).

To achieve the following functions defined in the new operation:

Create a sequence table with the help of ListInsert_Sq operations: ListCreate_Sq (?)

Calculate the length of the linear table: ListLength_Sq (?)

All the elements in the print order table: ListPrint_Sq (?)

Among them, please add the appropriate parameter table

Call the function in the main function to test, give the test results screenshot