@@ -0,0 +1,848 @@
+package jp.com.argorithm;%0A%0Apublic abstract class AbstractSort %7B%0A%0A    /* Constant */%0A%0A    /** Initial value **/%0A    protected final int DEFAULT = Integer.MIN_VALUE;%0A%0A    /** Sentinel **/%0A    protected final int SENTINEL = Integer.MAX_VALUE;%0A%0A    /* Member variable */%0A%0A    /** Array to be sorted **/%0A    protected final int%5B%5D searchArray;%0A%0A    /** Sorted array **/%0A    protected int%5B%5D sorted;%0A%0A    /* constructor */%0A%0A    protected AbstractSort(int%5B%5D args) %7B%0A        this.searchArray = args;%0A    %7D%0A%0A    /**%0A     * use the random sequences%0A     * @param maxArray Number of arrays%0A     * @param maxValue 1%EF%BD%9Eany value%0A     */%0A    protected AbstractSort(int maxArray, int maxValue) %7B%0A        searchArray = new int%5BmaxArray%5D;%0A        for (int i = 0; i %3C maxArray; i++) %7B%0A            searchArray%5Bi%5D = (int) (Math.random() * maxValue + 1);%0A        %7D%0A    %7D%0A%7D%0A

Create AbstractSort.java