归并排序（排序6）

import java.util.Arrays;

public class MergetSort {
    public static void main(String[] args) {
        int arr[]={9,8,7,6,5,4,3,2,1};
        int[] temp = new int[arr.length];
        mergeSort(arr,0, arr.length-1,temp);
        System.out.println(Arrays.toString(arr));
    }
    public static void merge(int arr[],int left ,int right,int [] temp){
        int t = 0;
        int i = left;
        int mid = (left+right)/2;
        int j = mid+1;
        while(i<=mid&&j<=right){
            if(arr[i]<=arr[j]){
                temp[t] = arr[i];
                t++;
                i++;
            }else{
                temp[t] = arr[j];
                j++;
                t++;
            }
        }
        while(i<=mid){
            temp[t] = arr[i];
            t++;
            i++;
        }
        while(j<=right){
            temp[t] = arr[j];
            t++;
            j++;
        }
        t = 0;
        int templeft = left;
        while(templeft<=right){
            arr[templeft] = temp[t];
            t++;
            templeft++;
        }
    }
    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,right,temp);
        }
    }
}