排序算法：对数器（验证算法正确性）

对数器：验证算法正确性

/**
 * 排序算法：对数器（验证算法的正确性）
 * 时间复杂度:n*log N
 * 空间复杂度：log N
 *
 */
public class SortLogarithmicDetector {

    private static final int DEFAULT_ARR_LENGTH = 3000;

    private static final int RANDOM_BOUND = 5000;

    public static void main(String[] args) {
        int[] randomArr = getRandomArr(getRandomLength());
        System.out.println(check(randomArr));
        System.out.println("++" + Arrays.toString(randomArr));
    }

    /**
     * 申请长度的数组为3001或3000
     *
     * @return
     */
    public static int getRandomLength() {
        return (int) (Math.random() * 2) + DEFAULT_ARR_LENGTH;
    }

    /**
     * 填充数组
     *
     * @param length
     * @return
     */
    public static int[] getRandomArr(int length) {
        int[] arr = new int[length];
        for (int i = 0; i < length; i++) {
            arr[i] = (int) (Math.random() * RANDOM_BOUND);
        }
        return arr;
    }

    /**
     * 校验自己写的排序算法，是否正确
     *
     * @param arr
     * @return
     */
    public static boolean check(int[] arr) {
        int arrLength = arr.length;
        int[] target = new int[arrLength];
        System.arraycopy(arr, 0, target, 0, arrLength);
        Arrays.sort(arr);

        SelectionSort.sort2(target);
//        MergeSort.sort(target, 0, arrLength - 1);
//        QuickSort.sort(target, 0, arrLength - 1);

        System.out.println("--" + Arrays.toString(target));
        boolean isTrue = true;
        for (int i = 0; i < arrLength; i++) {
            if (arr[i] != target[i]) {
                //打印两个数组有差异的值
                System.out.println("arr=" + arr[i]);
                System.out.println("target=" + target[i]);
                isTrue = false;
            }
        }
        return isTrue;
    }
}