算法思路

mergeSort.jpg

1. 把待排序List中間切分成2段，而且是遞歸切分，直到子List元素只有1個(gè)結(jié)束。
2. 把切分好的子List，進(jìn)行按照大小進(jìn)行排序merge，合成一個(gè)List。
3. 重復(fù)這個(gè)過程，直到形成一個(gè)完整的排序好的List。

算法實(shí)現(xiàn)

class TestClass {
    public static void main(String args[] ) throws Exception {
        /* Sample code to perform I/O:
         * Use either of these methods for input

        //BufferedReader
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String name = br.readLine();                // Reading input from STDIN
        System.out.println("Hi, " + name + ".");    // Writing output to STDOUT

        //Scanner
        Scanner s = new Scanner(System.in);
        String name = s.nextLine();                 // Reading input from STDIN
        System.out.println("Hi, " + name + ".");    // Writing output to STDOUT

        */

        // Write your code here
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();                 // Reading input from STDIN
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = s.nextInt();
        }
        
        mergeSort(a, 0, n - 1);
        for (int i = 0; i < n; i++) {
            System.out.printf("%d ", a[i]);
        }
    }
    
    private static void mergeSort(int[] a, int low, int high) {
        if (low >= high) {
            return;
        }
        
        int mid = low + (high - low) / 2;
        mergeSort(a, low, mid);
        mergeSort(a, mid + 1, high);
        
        merge(a, low, mid, high);
    }
    
   private static void merge(int[] a, int low, int mid, int high) {

        int[] nums = new int[high - low + 1];
        // 合并的第一個(gè)數(shù)組起始位置p
        // 合并的第二個(gè)數(shù)組起始位置q
        int p = low, q = mid + 1;
        int index = 0;
        while (p <= mid && q <= high) {
            if (a[p] < a[q]) {
                nums[index++] = a[p++];
            } else {
                nums[index++] = a[q++];
            }
        }

        while (p <= mid) {
            nums[index++] = a[p++];
        }

        while (q <= high) {
            nums[index++] = a[q++];
        }

        System.arraycopy(nums, 0, a, low, high - low + 1);
    }