归并排序

import java.util.Arrays;

/**
 * 实现归并排序
 */
public class MergeSort {
    public static void main(String[] args) {
//        int[] arr = { 8, 4, 5, 7, 1, 3, 6, 2 };
        int[] arr = new int[800000];
        for (int i = 0; i < 800000; i++) {
            arr[i] = (int) (Math.random() * 800000); // 生成一个[0, 8000000) 数
        }

        int temp[] = new int[arr.length];
        long startTime = System.currentTimeMillis();
        mergeSort(arr,0,arr.length-1,temp);
        long endTime = System.currentTimeMillis();
        System.out.println("程序运行时间： "+(endTime-startTime)+"ms");
//        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);
        }
    }

    public static void merge(int[] arr,int left,int mid,int right,int[] temp){
        int i = left;
        int j = mid+1;
        int t = 0;
        while(i<=mid && j<=right){
            if (arr[i]>arr[j]){
                temp[t] = arr[j];
                j++;
                t++;
            }else {
                temp[t] = arr[i];
                i++;
                t++;
            }
        }
        //左边多余元素加入数组
        while(i<=mid){
            temp[t] = arr[i];
            i++;
            t++;
        }
        //右边多余元素加入数组
        while(j<=right){
            temp[t] = arr[j];
            j++;
            t++;
        }
        //将temp数组的元素拷贝到arr
        t=0;
        int tempLeft = left;
        while(tempLeft<=right){
            arr[tempLeft] = temp[t];
            t++;
            tempLeft++;
        }
    }
}