1、设线性表的数据元素都为整数，存放在顺序表S中且递增有序。设计算法，将x插入到顺序表S的适当位置上，以保持线性表的有序性。
2、线性表使用顺序表作存储结构，设计算法，仅用一个辅助结点，实现将顺序表中的结点循环右移k位的运算。
3、设计算法，仅用一个辅助结点，实现将顺序存储的线性表中的数据元素逆置。(1. The data elements of the linear table are all integers. They are stored in the sequential table S and are ordered in increments. The design algorithm inserts the X into the proper place of the order table S to keep the order of the linear table.
2, the linear table uses the order table as the storage structure, designs the algorithm, uses only one auxiliary node, realizes the node in the order table to move to the right K bit.
3. The design algorithm uses only one auxiliary node to implement the inverse of the data elements in the linear table stored sequentially.)