But we have one last step which is obviously merge the sorted halves.
现在还需要最后一步,很明显就是合并有序的两半。
Quick sorts, unlike merge sorts, have no combining step: two subarrays form an already-sorted array.
快速排序,与合并排序,没有结合一步:两个子阵形成一个已经排好序的数组。
Emit the strings in the sorted output based on the results of step 3.
根据步骤3的结果,在已排序的输出中发出字串。
But we have one last step which is obviously merge the sorted halves.
现在还需要最后一步,很明显就是合并有序的两半。
应用推荐