归并排序算法

归并排序算法

package com.example.demo02;
import java.util.Arrays;
/**
 * @program: demo
 * @description: 归并排序
 * @author: ZCY
 * @create: 2022-01-21 15:28
 **/
public class MergeSort {
    //arr在[L,R]上有序
    public static void process(int[] arr, int L, int R) {
        if (L == R) {
            return;
        }
        int mid = L + ((R - L) >> 1);
        process(arr, L, mid);
        process(arr, mid + 1, R);
        merge(arr,L,R,mid);
    }
    
    //定义两个指针，对应要进行归并的两个数组的头元素 [5,2,6,3] [8,4,6,4]
    //比较指针对应的值，将小的值存入tmp中(相等时默认存入左边数组中对应元素)
    public static void merge(int[] arr, int L, int R, int mid) {
        int[] tmp = new int[R - L + 1];
        int i = 0;
        int p1 = L;
        int p2 = mid + 1;
        while (p1 <= mid && p2 <= R) {
            tmp[i++] = arr[p1] <= arr[p2] ? arr[p1++] : arr[p2++];
        }
        while (p1<=mid){
            tmp[i++]=arr[p1++];
        }
        while (p2<=R){
            tmp[i++]=arr[p2++];
        }
       for (int i1 = 0; i1 < tmp.length; i1++) {
            arr[L+i1]=tmp[i1];
        }
    }   
    
    public static void main(String[] args) {
        int[] arr={5,2,6,3,8,4,6,4};
        process(arr,0,arr.length-1);
        System.out.println(Arrays.toString(arr));
    }
}