算法导论示例-MergeSort

/**
 * Introduction to Algorithms, Second Edition 
 * 2.3 MergeSort
 * @author 土豆爸爸
 * 
 */
public class MergeSort {
    public static void sort(int[] array, int p, int r) {
        if (p < r) {
            int q = (p + r) / 2;
            sort(array, p, q);
            sort(array, q + 1, r);
            merge(array, p, q, r);
        }
    }

    public static void merge(int[] array, int p, int q, int r) {
        int n1 = q - p + 1;
        int n2 = r - q;
        int[] L = new int[n1 + 1];
        int[] R = new int[n2 + 1];

        int i = 0;
        int j = 0;
        for (i = 0; i < n1; i++) {
            L[i] = array[p + i];
        }
        L[i] = Integer.MAX_VALUE;

        for (j = 0; j < n2; j++) {
            R[j] = array[q + j + 1];
        }
        R[j] = Integer.MAX_VALUE;

        i = 0;
        j = 0;
        for (int k = p; k <= r; k++) {
            if (L[i] <= R[j]) {
                array[k] = L[i++];
            } else {
                array[k] = R[j++];
            }
        }
    }
}

import junit.framework.TestCase;

public class MergeSortTest extends TestCase {
    public void testFixArray() {
        int[] array = { 5, 2, 4, 7, 1, 3, 2, 6 };
        MergeSort.sort(array, 0 , array.length -1);
        assertTrue(verifyOrdered(array));
    }

    public void testRandomArray() {
        int size = (int)(Math.random()* 1000);
        int[] array = new int[size];
        for(int i = 0; i < size; i++) {
            array[i] =  (int)(Math.random()* 10000);
        }
        
        MergeSort.sort(array, 0 , array.length -1);
        assertTrue(verifyOrdered(array));
    }
    
    private boolean verifyOrdered(int[] array) {
        for (int i = 1; i < array.length; i++) {
            if (array[i - 1] > array[i]) {
                return false;
            }
        }
        return true;
    }
}