归并排序

package org.structure.sort;

import java.util.Arrays;

/**
 * 归并排序
 * @author cjj_1
 * @date 2020-08-17 14:58
 */
public class DivideAndConquer {
    public static void main(String[] args) {
        int[] arr={7,8,2,1,4,3,6,5};
        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){
        int mid = (left+right)/2;
        if (left<right){
            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[i];
                t++;
                i++;
            }else {
                temp[t] = arr[j];
                t++;
                j++;
            }
        }
        //如果左半边还有数据，则依次存放到temp;
        while (i<=mid){
            temp[t] = arr[i];
            t++;
            i++;
        }
        //如果右边还有数据，则依次存放到temp
        while (j<=right){
            temp[t] = arr[j];
            t++;
            j++;
        }
        //把temp 数据copy到arr中
        int templeft = left;
        int t1 = 0;
        while(templeft<=right){
            arr[templeft] = temp[t1];
            templeft++;
            t1++;
        }
    }
}