1、设线性表存放在向量A[arrsize]的前elenum个分量中，且递增有序。试设计一算法，将x插入到线性表的适当位置上，以保持线性表的有序性。

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

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

-1, a set of linear table stored in the vector A [arrsize] the former elenum components and incremental orderly. Try to design an algorithm, x is inserted into the appropriate position of the linear form, in order to maintain the orderliness of the linear form of the. 2, with the vector storage structure, try to design an algorithm, with only a secondary node, linear in k-bit computing node rotate right. 3 vector for the storage structure, and try to design an algorithm, only a secondary node, inverse linear table set computing.