归并:是一个先分在治的过程。
package Sort;
import java.util.Arrays;
public class MergeSort {
public static void main(String[] args) {
int[] arr = {8, 4, 5, 7, 1, 3, 6, 2};
int[] temp = new int[arr.length];
mergeSort(arr, 0, arr.length - 1, temp);
System.out.println("归并排序后=" + Arrays.toString(arr));
}
//分+合的方法
public static void mergeSort(int[] arr, int left, int right, int[] temp) {
if (left < right) {
int mid = (left + right) / 2;
//向左递归
mergeSort(arr, left, mid, temp);
//向右递归
mergeSort(arr, mid + 1, right, temp);
merge(arr, left, mid, right, temp);
}
}
//arr 排序的原始数组 left左边有序序列的初始索引 mid中间索引
//right 右边索引 temp做中转的数组
public static void merge(int[] arr, int left, int mid, int right, int[] temp) {
int i = left;//初始化i,左边有序序列的初始索引
int j = mid + 1;//右边索引
int t = 0;//指向temp数组的当前索引
//1.
//先把左右两边的有序数据按照规则填充到temp数组,直到左右两边有一边处理完毕
while (i <= mid && j <= right) {
if (arr[i] <= arr[j]) {
temp[t] = arr[i];
i += 1;
t += 1;
}else {
temp[t] = arr[j];
t += 1;
j += 1;
}
}
//2.
//把剩余数据的一边依次填充到temp
while (i <= mid) {//这里是左边的剩余元素
temp[t] = arr[i];
t += 1;
i += 1;
}
while (j <= right) {//这里是右边的剩余元素
temp[t] = arr[j];
t += 1;
j += 1;
}
//3.将temp数组的元素拷贝到arr 但并不是每次都拷贝所有
t = 0;
int tempLeft = left;
System.out.println("tempLeft="+tempLeft+" right"+right);
while (tempLeft <= right) {
arr[tempLeft] = temp[t];
t += 1;
tempLeft += 1;
}
}
}