顺序表的查找、插入与删除。设计算法，实现线性结构上的顺序表的产生以及元素的查找、插入与删除。具体实现要求：

1.　　从键盘输入10个整数，产生顺序表，并输入结点值。

2.　　从键盘输入1个整数，在顺序表中查找该结点的位置。若找到，输出结点的位置；若找不到，则显示“找不到”。

3.　　从键盘输入2个整数，一个表示欲插入的位置i，另一个表示欲插入的数值x，将x插入在对应位置上，输出顺序表所有结点值，观察输出结果。

4.　　从键盘输入1个整数，表示欲删除结点的位置，输出顺序表所有结点值，观察输出结果。

-Order table lookup, insertion and deletion. Design algorithms, and produce as well as elements of the linear structure on the order table lookup, insert and delete. Concrete realization of the requirements:

An input 10 integers from the keyboard, resulting in the order table and enter the node values​ ​ .

(2) from the keyboard to enter an integer in the sequence table to find the location of the node. If found, the location of output nodes　if no shows "not found".

3 input two integers from the keyboard, a position i want to insert another expressed the wish to insert the value of x, x is inserted in the corresponding position on all the node values ​ ​ of the output sequence table to observe the output.

4 Enter an integer from the keyboard to indicate the position you want to delete the node, all node values ​ ​ of the output sequence table to observe the output.