将2个有序的数组合并为一个有序的数组 时间复杂度为O(nlogn)
默认是按升序进行排序：
public class MergeSort { public static int[] sort(int[] data, int low, int high) {int mid = (low + high) / 2;if (low < high) {sort(data, low, mid);sort(data, mid+1, high);merge(data, low, mid, high);}return data;}public static void merge(int[] data, int left, int mid, int right){int[] tmp = new int[right - left + 1];int i = left, j = mid+1, k = 0; while ((i < mid) && (j < right)) {if (data[i] < data[j]) {tmp[k++] = data[i++];}else {tmp[k++] = data[j++];}}while (i <= mid){tmp[k++] = data[i++];}while (j <= right){tmp[k++] = data[j++];}for (int m = 0; m < tmp.length; m++) {data[m + left] = tmp[m];}}public static void main(String[] args) { int[] data = {-14, 27, 13, 6, 8, 6, 89, 10, 34, 4}; MergeSort.sort(data, 0, data.length-1); }
}
)
)
)
