Introduction - If you have any usage issues, please Google them yourself
(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.