合并排序算法

import java.util.Scanner;

public class 合并排序 {
    public static void main(String[] args) {
        Scanner scanner =new Scanner(System.in);
        int a;
         System.out.print("输入数组个数");
        a= scanner.nextInt();
        int arr[] = new int[a];
        for (int i=0;i<a;i++)
            arr[i]=(int)(Math.random()*100+1);
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+",");
        }
        System.out.println();
        mergeSort(arr);
        System.out.print("合并排序之后的数组：");
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+",");
        }
    }

    //sort方法的驱动程序
    private static void mergeSort(int[] arr) {
        sort(arr, 0, arr.length - 1);
    }

    //将tmp和Cctr当做参数传入，方便调用merge方法时获得这两个参数
    private static void sort(int[] arr, int left, int right) {
        int mid = (left + right) / 2;
        //当分到只剩下一个元素的情况,则退出递归程序
        if (left >= right) {
            return;
        }
        sort(arr, left, mid);
        sort(arr, mid + 1, right);
        merge(arr, left, mid, right);
    }

    private static void merge(int[] arr, int left, int mid, int right) {
        //声明三个计时器
        int Actr = left;
        int Bctr = mid + 1;
        int Cctr = 0;
        //创建临时数组,长度为A，B数组长度之和
        int[] tmp = new int[right - left + 1];
        //循环A，B中长度较短的长度次数的二倍的次数
        while (Actr <= mid && Bctr <= right) {
            if (arr[Actr] <= arr[Bctr]) {
                tmp[Cctr++] = arr[Actr];
                Actr++;
            } else {
                tmp[Cctr++] = arr[Bctr];
                Bctr++;
            }
        }
        //如果左边的还有剩余，将左边剩余的合并
        while (Actr <= mid){
            tmp[Cctr ++] = arr[Actr ++];
        }
        //如果右边的还有剩余，将右边剩余的合并
        while (Bctr <= right){
            tmp[Cctr ++] = arr[Bctr ++];
        }
        //将临时数组更新到原数组
        for (int i = 0; i < tmp.length; i++) {
            arr[left++] = tmp[i];
        }
    }
}