1、设线性表以顺序存储结构存储，且递增有序。设计算法，将x插入到线性表的适当位置上，以保持线性表的有序性。

2、用数组作存储结构，设计算法，仅用一个辅助结点，实现将线性表中的结点循环右移k位。

3、用数组作存储结构，设计算法，仅用一个辅助结点，实现将线性表逆置。

-1, set the table in order to store the linear structure of the storage, and the increasing order. Design algorithm, x is inserted into the appropriate position on the linear form, in order to maintain orderly linear form.

2, with an array for storage structure, design algorithms, only one secondary node to achieve linear table node k rotate right position.

3, with the array as a storage structure, design algorithms, only one secondary node to achieve inverse linear table set.