1、顺序表基本操作的实现

[问题描述] 当我们要在顺序表的第i个位置上插入一个元素时，必须先将顺序表中第i个元素之后的所有元素依次后移一个位置，以便腾空一个位置，再把新元素插入到该位置。若是欲删除第i个元素时，也必须把第i个元素之后的所有元素前移一个位置。

[基本要求] 要求生成顺序表时，可以键盘上读取元素，用顺序存储结构实现存储。

-1, the basic operation of the order of the table to achieve [Problem Descr iption] When we have to the table in the order of the first i positions to insert an element, you must first order of the table after the first i elements in turn to all elements of a position after the shift to vacated a position, then insert a new element to that location. If you want to delete the first i elements, they must be after the first i elements in one place all the elements forward. [Basic requirements] requirements of the build order table, you can read the elements on the keyboard, with the storage structure in order to achieve storage.