归并排序是建立在归并操作上的一种有效的排序算法,该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。将已有序的子序列合并，得到完全有序的序列；即先使每个子序列有序，再使子序列段间有序。若将两个有序表合并成一个有序表，称为二路归并。-Merge sort is established in the merge operation a effective sorting algorithm. The algorithm is using the divide and conquer (divide and conquer) a very typical application. The ordered sequence of sub sequences is obtained, which is to get the sequence of the complete sequence, that is, the order of each sub sequence is ordered, and the order of the sub sequence is ordered. To merge the two ordered tables into an ordered form, called the two merge.