Description: (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.
To Search:
File list (Check if you may need any files):
xianxingbiao.doc