最优合并问题

给定K个排好序的序列s1,s2,...,sk,用2 路合并算法将这k个序列合并成一个序列。

假设所采用的2路合并算法合并2个长度分另为m 和n的序列需要m+n-1次比较。试设计一个算法确定合并这个序列的最优合并顺序，使所需的总比较次数最少。-optimal merging given K platoons good sequence of sequence s1, s2 ,..., sk. using 2-way merger of this algorithm k sequence into a series. Assumptions used by the two merging algorithm along with two others for the length m and n the sequence needs m n-1 comparisons. Algorithm design a test to determine the sequence of the merger combined the optimal sequence, and allows comparison of the total number at least.