Java排序算法：父接口&测试类

排序算法类的父接口和测试工具类

代码结构

源码

package suanfa.paixu;

public class DuiShuQi {
    public static int[] getArr(int maxL, int maxV) {
        int l = (int) (Math.random() * maxL);
        int[] arr = new int[l];
        for (int i = 0; i < l; i++) {
            arr[i] = (int) ((Math.random() - Math.random()) * maxV);
        }
        return arr;
    }

    public static int[] copyArr(int[] arr) {
        int[] arr1 = new int[arr.length];
        for (int i = 0; i < arr.length; i++) {
            arr1[i] = arr[i];
        }
        return arr1;
    }

    public static boolean isSortArr(int[] arr) {
        for (int i = 1; i < arr.length; i++) {
            if (arr[i - 1] > arr[i]) {
                return false;
            }
        }
        return true;
    }

    public static boolean isEqual(int[] arr1, int[] arr2) {
        if (arr1 == arr2) {
            return true;
        }
        if (arr1 == null || arr2 == null) {
            return false;
        }
        if (arr1.length != arr2.length) {
            return false;
        }
        for (int i = 0; i < arr1.length; i++) {
            if (arr1[i] != arr2[i]) {
                return false;
            }
        }
        return true;
    }
}

package suanfa.paixu;

public interface Sort {
    void sort(int[] arr);

    default void swap(int[] arr, int i, int j) {
        int num = arr[i];
        arr[i] = arr[j];
        arr[j] = num;
    }
}

package suanfa.paixu;

import static suanfa.paixu.DuiShuQi.*;

public class Test {
    public static void test(Sort sort) {
        int testNum = 99999;
        int maxValue = 999;
        int maxSize = 666;
        System.out.println("测试开始");
        for (int i = 0; i < testNum; i++) {
            int[] arr1 = getArr(maxSize, maxValue);
            sort.sort(arr1);
            if (!isSortArr(arr1)) {
                System.out.println("出错了！");
                out(arr1);
                break;
            }
        }
        System.out.println("测试结束");
    }

    public static void test(Sort sort1, Sort sort2) {
        int testNum = 500000;
        int maxSize = 100;
        int maxValue = 100;
        System.out.println("测试开始");
        for (int i = 0; i < testNum; i++) {
            int[] arr1 = getArr(maxSize, maxValue);
            int[] arr2 = copyArr(arr1);
            sort1.sort(arr1);
            sort2.sort(arr2);
            if (!isEqual(arr1, arr2)) {
                System.out.println("出错了！");
                out(arr1);
                out(arr2);
                break;
            }
        }
        System.out.println("测试结束");
    }

    private static void out(int[] arr) {
        for (int i : arr) {
            System.out.print(i + " ");
        }
    }
}