前言
合并排序是分治法当中一个经典的排序算法,它通过将规模为n的原始问题分解为n/2,然后得到各自的解后,在合并两个子问题的解,最终得到原始问题的解。合并排序属于稳定排序,在排序过程中,如果遇到Ai==Aj,假设i < j,在完成排序后不会影响Ai和Aj的相对位置,即Ai仍然在Aj前面。
合并排序的时间复杂度是O(nlogn),但是在排序当中需要递归拆分元问题,空间复杂度是O(n),合并排序是用空间换时间的算法。图例
本文即将对数组{ 6, 10, 25, 3, 33, 90, 60, 100, 56 }进行排序,合并排序的过程如下图:
实现
package com.yellow.mergesort;
import java.util.Arrays;
public class MergeSort {
public static void main(String[] args) {
int original[] = new int[] { 6, 10, 25, 3, 33, 90, 60, 100, 56 };
mergeSort(original);
print(original);
}
private static void mergeSort(int[] original) {
if (original == null) {
throw new NullPointerException("The array can not be null !!!");
}
int length = original.length;
if (length > 1) {
int middle = length / 2;
int partitionA[] = Arrays.copyOfRange(original, 0, middle);// 拆分问题规模
int partitionB[] = Arrays.copyOfRange(original, middle, length);
// 递归调用
mergeSort(partitionA);
mergeSort(partitionB);
sort(partitionA, partitionB, original);
}
}
private static void sort(int[] partitionA, int[] partitionB, int[] original) {
int i = 0;
int j = 0;
int k = 0;
while (i < partitionA.length && j < partitionB.length) {
if (partitionA[i] <= partitionB[j]) {
original[k] = partitionA[i];
i++;
} else {
original[k] = partitionB[j];
j++;
}
k++;
}
if (i == partitionA.length) {
while (k < original.length) {
original[k] = partitionB[j];
k++;
j++;
}
} else if (j == partitionB.length) {
while (k < original.length) {
original[k] = partitionA[i];
k++;
i++;
}
}
}
private static void print(int[] array) {
if (array == null) {
throw new NullPointerException("The array can not be null !!!");
}
StringBuilder sb = new StringBuilder("[");
for (int element : array) {
sb.append(element + ", ");
}
sb.replace(sb.length() - 2, sb.length(), "]");
System.out.println(sb.toString());
}
}
输出结果为: