(1)输入一组整型元素序列，建立顺序表。

(2)实现该顺序表的遍历。

(3)在该顺序表中顺序查找某一元素,查找成功返回1,否则返回0。

(4)判断该顺序表中元素是否对称,对称返回1,否则返回0。

(5)实现把该表中所有奇数排在偶数之前,即表的前面为奇数,后面为偶数。

(6)输入整型元素序列利用有序表插入算法建立一个有序表。

(7)利用算法6建立两个非递减有序表并把它们合并成一个非递减有序表。

(8)编写一个主函数,调试上述算法。-(1) enter a sequence of integer elements, to establish the order form. (2) implement the order of table traverse. (3) in the sequence table to find an element in order to find successful return 1, otherwise it returns 0. (4) to determine the order of elements in the table is symmetrical, symmetrical returns 1, otherwise it returns 0. (5) to achieve all of the odd row of the table on even before the table in front of an odd, back to even. (6) the use of the input sequence of integer elements ordered table insertion algorithm to establish an orderly table. (7) the use of algorithms to create two non-decreasing order 6 tables and combining them into a non-decreasing order form. (8) write a main function, the debugger the above algorithm.