(1)．输入一组整型元素序列，建立顺序表。 (2)．实现该顺序表的遍历。 (3)．在该顺序表中顺序查找某一元素,查找成功返回1,否则返回0。 (4)．判断该顺序表中元素是否对称,对称返回1,否则返回0。 (5)．实现把该表中所有奇数排在偶数之前,即表的前面为奇数,后面为偶数。 (6)．输入整型元素序列利用有序表插入算法建立一个有序表。 (7)．利用算法6建立两个非递减有序表并把它们合并成一个非递减有序表。 (8)．编写一个主函数,调试上述算法。-(1). Enter a sequence of integer elements, the establishment of the order form. (2). Order to achieve the traverse table. (3). In the order of an element lookup table in order, find success return 1, otherwise return 0. (4). Order to determine the elements in the table is symmetrical, symmetry returns 1, otherwise it returns 0. (5). Implement all the odd rows of the table on even before the table in front of an odd number, followed by an even number. (6). Input integer sequence of elements ordered table insertion algorithm using a sorted list. (7). 6 using algorithms to create two non-decreasing order form and combining them into a non-decreasing order form. (8). Write a main function, debugging the algorithm.