归并排序：将数组划分为小数组,通过局部的有序合并,解决问题 算法平均时间复杂度: O(nlogn) -Merging Sort: The array is divided into a small array, in an orderly manner through the partial merger, the average time algorithm to solve the problem complexity: O (nlogn)