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

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

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

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

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

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

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

(8)．编写一个主函数,调试上述算法。

-(1). Enter an integer sequence of elements, and to establish the sequence table. (2). Traversal of the sequence table. (3). Sequential search of an element in the sequence table, find a successful return 1, otherwise return 0. (4). Determine the elements in the sequence table is symmetrical, symmetrical returns 1, otherwise it returns 0. (5). To achieve all odd row in the table prior to the even-numbered, i.e. the front of the table is odd, is even later. (6). Enter integer sequence of elements ordered table insertion algorithm to create a disciplined table. (7). Algorithm 6 to create two non-decreasing ordered list and merge them into a non-decreasing ordered list. (8). Write a main function, commissioning of the above algorithm.