设子数组a[0 k]和a[k+1 n-1]已排好序。设计一个合并这两个子数组为排好序的数组a[0 n-1]的算法-set up a sub-array [0 k] and a [k a n-1] is already good order. Design of a merger of the two sub-arrays for arranging the order of the array a [0 n-1] algorithm