学习二路归并排序算法

package t1;

public class test00 {
public static int[] mergeSort(int[] nums, int l, int h) {
if (l == h)
return new int[] { nums[l] };

int mid = l + (h - l) / 2;

int[] leftArr = mergeSort(nums, l, mid); // 左有序数组
for (int x : leftArr) {
System.out.print(x + " ");
}
System.out.println("");

int[] rightArr = mergeSort(nums, mid + 1, h); // 右有序数组
for (int x : rightArr) {
System.out.print(x + " ");
}
System.out.println("");

int[] newNum = new int[leftArr.length + rightArr.length]; // 新有序数组

int m = 0, i = 0, j = 0;
while (i < leftArr.length && j < rightArr.length) {
newNum[m++] = leftArr[i] < rightArr[j] ? leftArr[i++] : rightArr[j++];
}
while (i < leftArr.length)
newNum[m++] = leftArr[i++];
while (j < rightArr.length)
newNum[m++] = rightArr[j++];
return newNum;
}

public static void main(String[] args) {
int[] nums = new int[] { 4, 3, 6, 1, 2, 5, 8, 7 };
int[] newNums = mergeSort(nums, 0, nums.length - 1);
for (int x : newNums) {
System.out.print(x + " ");
}
}
}

输出：

扫描二维码关注公众号，回复： 10188592 查看本文章