要求先对所输入序列进行扫描。输入序列为整形数据，用正序、逆序和不同乱序程度的不同数据作测试比较。

2）通过扫描，找出序列中已经存在的最大有序列，将原序列分为若干个有序子列。

3）用归并法，对“2”中有序子列进行归并。

4）本程序要求用顺序链表作为存储结构。

5）演示程序以用户和计算机的对话式执行，即在计算机终端上显示“提示信息”下，用户可由键盘输入待排序表的表长（0--100)和不同测试数据的组数（3－8）。每次测试完毕，列表显示测试结果。

-first requested by the input sequences to scan. The importation of plastic sequence data, the sequence is used, Roget different disorder and the different levels of test data for comparison. 2) scanning to identify sequences already exist with the largest sequence, the original series divided into a number of sub-out in an orderly manner. 3) Using Merging of "2" orderly son out for merging. 4) The procedural requirements with the order Listless as storage structure. 5) Demonstration Program to users and computer-implementation of the dialogue, that is displayed on the computer terminal, "message", users can sort keyboarding question long table in the table (0 -- 100) and the different test data group (3-8). Each test finished, the table shows the test results.