package 测试包;
import java.util.Arrays;
public class MergeSort {
/**
* 归并排序
* 简介:将两个(或两个以上)有序表合并成一个新的有序表 即把待排序序列分为若干个子序列,每个子序列是有序的。
* 然后再把有序子序列合并为整体有序序列
* 时间复杂度为O(nlogn)
* 稳定排序方式
* aa[]待排序数组
* 输出有序数组
*/
public static int[] sort(int[] aa, int low, int high) {
int mid = (low + high) / 2;
if (low < high) {
sort(aa, low, mid);
sort(aa, mid + 1, high);
merge(aa, low, mid, high);
}
return aa;
}
public static void merge(int[] aa, int low, int mid, int high) {
int[] temp = new int[high - low + 1];
int i = low;
int j = mid + 1;
int k = 0;
while (i <= mid && j <= high) {
if (aa[i] < aa[j]) {
temp[k++] = aa[i++];
} else {
temp[k++] = aa[j++];
}
}
while (i <= mid) {
temp[k++] = aa[i++];
}
while (j <= high) {
temp[k++] = aa[j++];
}
for (int k2 = 0; k2 < temp.length; k2++) {
aa[k2 + low] = temp[k2];
}
}
public static void main(String[] args) {
int[] aa = { 2, 7, 8, 3, 1, 6, 9, 0, 5, 4 };
MergeSort.sort(aa, 0, aa.length-1);
System.out.println(Arrays.toString(aa));
}
}