排序Java实现汇总

写在最前面：假如不明白排序的原理，请事先整明白再来阅读！！！
1.冒泡排序

package Sort;

import java.util.Arrays;

public class bubbleSort {
    public static void BubbleSort(int[] arr){
        if(arr.length < 2 || arr == null){
            return;
        }
        for(int i = arr.length - 1;i > 0;i--){
            for(int j = 0;j < i;j++){
                if(arr[j] > arr[j+1]){
                    swap(arr,j,j+1);
                }
            }

        }
    }
    public static void swap(int[] arr,int i,int j){
        int tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp;
    }
    //验证
    public static void comparator(int []arr){
        Arrays.sort(arr);
    }
    //随机生成数组
    public static int[] generateRandomArray(int maxSize,int maxValue){
        //Math.random():返回带正号的 double 值，该值大于等于 0.0 且小于 1.0。返回值是一个伪随机选择的数，在该范围内（近似）均匀分布。
        //第一次调用该方法时，它将创建一个新的伪随机数生成器，与以下表达式完全相同
        //此方法是完全同步的，可允许多个线程使用而不出现错误。但是，如果许多线程需要以极高的速率生成伪随机数，那么这可能会减少每个线程对拥有自己伪随机数生成器的争用。
        //返回：
        //大于等于 0.0 且小于 1.0 的伪随机 double 值。
        int[]arr = new int[(int)((maxSize + 1) * Math.random())];
        for(int i = 0;i < arr.length;i++){
            arr[i] = (int)((maxValue + 1) * Math.random()) - (int)((maxValue) * Math.random());
        }
        return  arr;
    }
    public static int[] copyArray(int[] arr){
        if(arr == null){
            return null;
        }
        int[] res = new int[arr.length];
        for (int i = 0;i < arr.length;i++){
            res[i] = arr[i];
        }
        return res;
    }
    public static void printArray(int[] arr){
        if(arr==null){
            return;
        }
        for(int i = 0;i < arr.length;i++){
            System.out.println(arr[i] + "");
        }
        System.out.println();
    }
    public static boolean isEqual(int[] arr1,int[] arr2){
        if((arr1 == null && arr2 != null) || (arr1 != null && arr2 == null)){
            return false;
        }
        if(arr1 == null && arr2 == null){
            return true;
        }
        for (int i = 0; i < arr1.length ; i++) {
            if(arr1[i] != arr2[i]){
                return false;
            }

        }
        return true;

    }

    public static void main(String[] args) {
        int testTimes = 10000;
        int maxSize = 100;
        int maxValue = 100;
        boolean succeed = true;
        for(int i = 0;i < testTimes;i++){
            int[] arr1 = generateRandomArray(maxSize,maxValue);
            int[] arr2 = copyArray(arr1);
            BubbleSort(arr1);
            comparator(arr2);
            if(!isEqual(arr1,arr2)){
                succeed = false;
                break;
            }
        }
        System.out.println(succeed?"nice!":"Fucking fucked!");

        int[] arr = generateRandomArray(maxSize,maxValue);
        printArray(arr);
        System.out.println("================================================================================");
        BubbleSort(arr);
        printArray(arr);
    }
}

2.插入排序

package Sort;

import java.util.Arrays;

public class insertSort{
    public static void InsertSort(int[] arr) {
        if (arr == null || arr.length < 2) {
            return;
        }
        for (int i = 1; i < arr.length; i++) {
            for (int j = i - 1; j >= 0 && arr[j] > arr[j + 1]; j--) {//前一个比后一个大就循环条件即可
                swap(arr, j, j + 1);
            }
        }
    }
        public static void swap(int[] arr,int i,int j){
            int tmp = arr[i];
            arr[i] = arr[j];
            arr[j] = tmp;
        }
        public static void comparator(int[] arr){//比较器
            Arrays.sort(arr);
        }
        public static int[] generateRandomArray(int maxSize,int maxValue){
            int[] arr = new int[(int) ((maxSize + 1) * Math.random())];
            for (int i = 0;i < arr.length;i++){
                arr[i] = (int)((maxValue + 1) * Math.random()) - (int)((maxValue) * Math.random());
            }
            return arr;

        }
        public static int[] copyArray(int[] arr){
            if(arr == null){
                return null;
            }
            int[] res = new int[arr.length];
            for(int i = 0;i < arr.length;i++){
                res[i] = arr[i];
            }
            return res;
        }
        public static boolean isEqual(int[] arr1,int[] arr2){//自己写的排序方法跟java库函数排序好的进行对比
            if((arr1 == null && arr2 != null)||(arr1 != null && arr2 ==null)){
                return false;
            }
            if(arr1 == null && arr2 == null){
                return true;
            }
            if(arr1.length != arr2.length){
                return false;
            }
            for(int i = 0;i < arr1.length;i++){
                if(arr1[i] != arr2[i]){
                    return false;
                }
            }
            return true;
        }

        public static void printArray(int[] arr) {
            if (arr == null) {
                return;
            }
            for (int i = 0; i < arr.length; i++) {
                System.out.print(arr[i] + " ");
            }
            System.out.println();
        }

        public static void main(String[] args){
            int testTimes = 10000;
            int maxSize = 100;
            int maxValue = 100;
            boolean succeed = true;
            for (int i = 0; i < testTimes; i++) {
                int[] arr1 = generateRandomArray(maxSize, maxValue);
                int[] arr2 = copyArray(arr1);
                InsertSort(arr1);
                comparator(arr2);
                if (!isEqual(arr1, arr2)) {
                    succeed = false;
                    break;
                }
            }
            System.out.println(succeed ? "nice! ":"fuck!");
            int[] arr = generateRandomArray(maxSize, maxValue);
            printArray(arr);
            InsertSort(arr);
            printArray(arr);

    }
}

3.归并排序

package Sort;

import java.util.Arrays;

public class MergeSort {
    public static void mergeSort(int[]arr){
        if(arr == null || arr.length < 2 ){
            return;
        }
        mergeSort(arr,0,arr.length - 1);
    }
    public static void mergeSort(int[] arr,int l,int r){
        if(l == r){
            return;
        }
        int mid = l + ((r - l)>>1);//可以避免超过int的表示范围，杜绝了越界可能性的发生
        mergeSort(arr,l,mid);
        mergeSort(arr,mid + 1,r);
        merge(arr,l,mid,r);
    }
    public static void merge(int[]arr,int l,int m,int r){
        int[] help = new int[r - l + 1];//辅助数组
        int i = 0;
        int p1 = l;
        int p2 = m + 1;

        while(p1 <=  m && p2 <= r){
            help[i++] = arr[p1] < arr[p2] ? arr[p1++]:arr[p2++];
        }
        while(p1 <= m){//此处的while与下处的while不可能同时发生：
            // 之所以要写这一部分是因为有可能有中间的元素值有很多
            help[i++] = arr[p1++];
        }
        while(p2 <= r){
            help[i++] = arr[p2++];
        }
        for(i = 0;i < help.length;i++){//复制回arr但是务必要加l
            arr[l + i] = help[i];
        }
    }
    
    public static void comparator(int[] arr) {//比较器
        
        Arrays.sort(arr);
    }
    public static int[] generateRandomArray(int maxSize, int maxValue) {
        int[] arr = new int[(int) ((maxSize + 1) * Math.random())];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = (int) ((maxValue + 1) * Math.random()) - (int) (maxValue * Math.random());
        }
        return arr;
    }
    
    public static int[] copyArray(int[] arr) {
        if (arr == null) {
            return null;
        }
        int[] res = new int[arr.length];
        for (int i = 0; i < arr.length; i++) {
            res[i] = arr[i];
        }
        return res;
    }

    public static boolean isEqual(int[] arr1, int[] arr2) {
        if ((arr1 == null && arr2 != null) || (arr1 != null && arr2 == null)) {
            return false;
        }
        if (arr1 == null && arr2 == null) {
            return true;
        }
        if (arr1.length != arr2.length) {
            return false;
        }
        for (int i = 0; i < arr1.length; i++) {
            if (arr1[i] != arr2[i]) {
                return false;
            }
        }
        return true;
    }
    
    public static void printArray(int[] arr) {
        if (arr == null) {
            return;
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }
    
    public static void main(String[] args) {
        int testTime = 500000;
        int maxSize = 100;
        int maxValue = 100;
        boolean succeed = true;
        for (int i = 0; i < testTime; i++) {
            int[] arr1 = generateRandomArray(maxSize, maxValue);
            int[] arr2 = copyArray(arr1);
            mergeSort(arr1);
            comparator(arr2);
            if (!isEqual(arr1, arr2)) {
                succeed = false;
                printArray(arr1);
                printArray(arr2);
                break;
            }
        }
        System.out.println(succeed ? "Nice!" : "Fucking fucked!");

        int[] arr = generateRandomArray(maxSize, maxValue);
        printArray(arr);
        mergeSort(arr);
        printArray(arr);

    }
}

应用：小和问题

package Sort;

public class smallSum {
    public static int SmallSum(int[]arr){
        if(arr == null || arr.length < 2){
            return 0;
        }
        return mergeSort(arr,0,arr.length - 1);
    }
    public static int mergeSort(int[] arr,int l,int r){
        if(l == r){
            return 0;
        }
        int mid =  l + (r - l) / 2;
        return mergeSort(arr,l,mid) + mergeSort(arr,mid + 1,r) + merge(arr,l,mid,r);

    }
    public static int merge(int[] arr,int l,int m,int r){
        int []res = new int[r - l + 1];//辅助数组
        int i = 0;
        int p1 = l ;
        int p2 = m + 1;
        int temp = 0;
        while(p1 <= m && p2 <= r){
            temp += arr[p1] < arr[p2] ? (r - p2 + 1) * arr[p1]:0;
            res[i++] = arr[p1] < arr[p2] ? arr[p1++]:arr[p2++];
        }
        while(p1 <= m){
            res[i++] = arr[p1++];
        }
        while(p2 <= r){
            res[i++] = arr[p2++];
        }
        for(int j = 0;j < res.length;j++){
            arr[l + j] = res[j];
        }
        return temp;
    }

    public static int comparator(int[]arr){
        if(arr == null || arr.length < 2){
            return 0;
        }
        int temp = 0;
        for(int i = 1;i < arr.length;i++){
            for(int j = 0;j < i;j++){
                temp += arr[j] < arr[i] ? arr[j]:0;
            }
        }
        return temp;
    }
    public static int[] generateRandomArray(int maxSize,int maxValue){
        int[] arr = new int[(int)((maxSize + 1) * Math.random())];
        for(int i = 0;i < arr.length;i++){
            arr[i] = (int)((maxValue + 1) * Math.random()) - (int)(maxValue * Math.random());
        }
        return arr;
    }
    public static int[] copyArray(int[] arr){
        if(arr == null){
            return null;
        }
        int[] res = new int[arr.length];
        for(int i = 0;i < arr.length;i++) {
            res[i] = arr[i];
        }
        return res;
    }
    public static boolean isEqual(int[] arr1,int[] arr2){
        if((arr1 == null && arr2 != null) || (arr1 != null && arr2 == null)){
            return false;
        }
        if(arr1 == null && arr2 == null){
            return true;
        }
        if(arr1.length != arr2.length){
            return false;
        }
        for(int i = 0;i < arr1.length;i++){
            if(arr1[i] != arr2[i]){
                return false;
            }
        }
        return true;
    }
    public static void printArray(int[] arr){
        if(arr == null){
            return;
        }
        for(int i = 0;i < arr.length;i++){
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    public static void main(String[] args) {
        int testTimes = 500000;
        int maxSize = 100;
        int maxValue = 100;
        boolean succeed = true;
        long start = System.currentTimeMillis();
        for(int i = 0;i < testTimes;i++){
            int[] arr1 = generateRandomArray(maxSize,maxValue);
            int[] arr2 = copyArray(arr1);
            if(SmallSum(arr1) != comparator(arr2)){
                succeed = false;
                printArray(arr1);
                printArray(arr2);
                break;
            }
        }
        long end = System.currentTimeMillis();
        System.out.println("Running time :" + (end - start));
        System.out.println(succeed ? "nice!":"Wrong!");
    }

}

4.快速排序

package Sort;

import java.util.Arrays;

public class quickSort {
    public static void QuickSort(int[] arr){
        if(arr == null || arr.length < 2){
            return;
        }
        QuickSort(arr,0,arr.length - 1);
    }
    public static void QuickSort(int[] arr,int l ,int r){
        if(l < r){
            //随机快速排序可以有效解决极端的有序情况出现造成的空间复杂度
            swap(arr,l + (int)(Math.random() * (r - l + 1)),r);
            int [] p = partition(arr,l,r);
            QuickSort(arr,l,p[0] -1);
            QuickSort(arr,p[1] + 1,r);
        }
    }
    public static int[] partition(int []arr,int l,int r){
        int less = l - 1;
        int more = r;
        while(l < more){
            if(arr[l] < arr[r]){
                swap(arr,++less,l++);
            }else if(arr[l] > arr[r]){
                swap(arr,--more,l);
            }else{l++;}
        }
        swap(arr,more,r);
        return new int[]{less+1,more};
    }
    public static void QuickSort1(int[] arr,int l,int r){
        if(l < r){
            int index = getIndex(arr,l,r);
            QuickSort1(arr,l,index - 1);
            QuickSort1(arr,index +1,r);
        }
    }
    public static int getIndex(int[] arr,int l,int r){
        int tmp = arr[l];
        while(l < r){
            while(l < r && arr[r] >= tmp){
                r--;
            }
            arr[l] = arr[r];
            while(l < r && arr[l] <= tmp){
                l++;
            }
            arr[r] = arr[l];
        }
        arr[l] = tmp;
        return l;
    }
    public static void swap(int[] arr,int i,int j){
        int tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp;
    }
    public static void comparator(int[] arr){
        Arrays.sort(arr);
    }
    public static int[] generateRandomArray(int maxSize,int maxValue){
        int[] arr = new int[(int)((maxSize + 1)*Math.random())];
        for(int i = 0;i < arr.length;i++){
            arr[i] = (int)((maxValue + 1) * Math.random()) - (int)(maxValue * Math.random());
        }
        return arr;
    }
    public static int[] copyArray(int []arr){
        if(arr == null){
            return null;
        }
        int[] res = new int[arr.length];
        for(int i = 0;i < arr.length;i++){
            res[i] = arr[i];
        }
        return res;
    }
    public static boolean isEqual(int[] arr1,int[] arr2){
        if((arr1 == null && arr2 != null) ||(arr1!=null && arr2 == null)){
            return false;
        }
        if(arr1 == null && arr2 == null){
            return true;
        }
        if(arr1.length != arr2.length){
            return false;
        }
        for(int i = 0;i <arr1.length;i++){
            if(arr1[i] != arr2[i]){
                return false;
            }
        }
        return true;
    }

    public static void main(String[] args) {
        int testTimes = 100000;
        int maxValue = 100;
        int maxSize = 100;
        boolean succeed = true;

        for(int i = 0;i < testTimes;i++){
            int[] arr1 = generateRandomArray(maxSize,maxValue);
            int[] arr2 = copyArray(arr1);
            QuickSort(arr1);
            comparator(arr2);
            if(!isEqual(arr1,arr2)){
                succeed = false;
                break;
            }
        }
        System.out.println(succeed?"good job":"what the fuck!");
    }
}

应用：荷兰国旗问题
代码实现：

package Sort;

public class NeverlandsFlag {
    public static int[] partition(int[] arr, int l, int r, int p) {
        int less = l - 1;
        int more = r + 1;
        while (l < more) {
            if (arr[l] < p) {
                swap(arr, ++less, l++);
            } else if (arr[l] > p) {
                swap(arr, --more, l);
            } else {
                l++;
            }
        }
        return new int[] { less + 1, more - 1 };

    }

    // for test
    public static void swap(int[] arr, int i, int j) {
        int tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp;
    }

    // for test
    public static int[] generateArray() {
        int[] arr = new int[10];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = (int) (Math.random() * 3);
        }
        return arr;
    }

    // for test
    public static void printArray(int[] arr) {
        if (arr == null) {
            return;
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    public static void main(String[] args) {
        int[] test = generateArray();

        printArray(test);
        int[] res = partition(test, 0, test.length - 1, 1);
        printArray(test);
        System.out.println(res[0]);
        System.out.println(res[1]);

    }
}

5.堆排序

package Sort;

import java.util.Arrays;

public class HeapSort {
    public static void heapSort(int[] arr) {
        if (arr == null || arr.length < 2) {
            return;
        }
        for (int i = 0; i < arr.length; i++) {
            heapInsert(arr, i);
        }
        int size = arr.length;
        swap(arr, 0, --size);
        while (size > 0) {
            heapify(arr, 0, size);
            swap(arr, 0, --size);
        }
    }

    public static void heapInsert(int[] arr, int index) {
        while (arr[index] > arr[(index - 1) / 2]) {
            swap(arr, index, (index - 1) / 2);
            index = (index - 1) / 2;
        }
    }

    public static void heapify(int[] arr, int index, int size) {
        int left = index * 2 + 1;
        while (left < size) {
            int largest = left + 1 < size && arr[left + 1] > arr[left] ? left + 1 : left;
            largest = arr[largest] > arr[index] ? largest : index;
            if (largest == index) {
                break;
            }
            swap(arr, largest, index);
            index = largest;
            left = index * 2 + 1;
        }
    }
    public static void swap(int[] arr, int i, int j) {
        int tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp;
    }

    // for test
    public static void comparator(int[] arr) {

        Arrays.sort(arr);
    }

    // for test
    public static int[] generateRandomArray(int maxSize, int maxValue) {
        int[] arr = new int[(int) ((maxSize + 1) * Math.random())];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = (int) ((maxValue + 1) * Math.random()) - (int) (maxValue * Math.random());
        }
        return arr;
    }

    // for test
    public static int[] copyArray(int[] arr) {
        if (arr == null) {
            return null;
        }
        int[] res = new int[arr.length];
        for (int i = 0; i < arr.length; i++) {
            res[i] = arr[i];
        }
        return res;
    }

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

    // for test
    public static void printArray(int[] arr) {
        if (arr == null) {
            return;
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    // for test
    public static void main(String[] args) {
        int testTime = 500000;
        int maxSize = 100;
        int maxValue = 100;
        boolean succeed = true;
        for (int i = 0; i < testTime; i++) {
            int[] arr1 = generateRandomArray(maxSize, maxValue);
            int[] arr2 = copyArray(arr1);
            heapSort(arr1);
            comparator(arr2);
            if (!isEqual(arr1, arr2)) {
                succeed = false;
                break;
            }
        }
        System.out.println(succeed ? "Nice!" : "Fucking fucked!");

        int[] arr = generateRandomArray(maxSize, maxValue);
        printArray(arr);
        heapSort(arr);
        printArray(arr);
    }
}

6.桶排序

package Sort;

import java.util.Arrays;

public class BucketSort {
    public static void bucketSort(int[]arr){
        if(arr == null || arr.length < 2){
            return;
        }
        int max = Integer.MIN_VALUE;
        for(int i = 0;i < arr.length;i++){
            max = Math.max(max,arr[i]);//数组中的最大值+1 = 桶的个数
        }
        int[] bucket = new int[max + 1];
        for(int i = 0;i < arr.length;i++){
            bucket[arr[i]]++;//将数字i放到bucket桶中，然后桶往后移动一个位置，接收下一个数组中的元素；
        }
        int i = 0;
        for(int j = 0;j < bucket.length;j++){
            while(bucket[j]-- > 0 ){//将桶中的数按照大小顺序传给arr
                arr[i++] = j;
            }
        }


    }

    // for test
    public static void comparator(int[] arr) {

        Arrays.sort(arr);
    }

    // for test
    public static int[] generateRandomArray(int maxSize, int maxValue) {
        int[] arr = new int[(int) ((maxSize + 1) * Math.random())];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = (int) ((maxValue + 1) * Math.random());
        }
        return arr;
    }

    // for test
    public static int[] copyArray(int[] arr) {
        if (arr == null) {
            return null;
        }
        int[] res = new int[arr.length];
        for (int i = 0; i < arr.length; i++) {
            res[i] = arr[i];
        }
        return res;
    }

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

    // for test
    public static void printArray(int[] arr) {
        if (arr == null) {
            return;
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    // for test
    public static void main(String[] args) {
        int testTime = 500000;
        int maxSize = 100;
        int maxValue = 150;
        boolean succeed = true;
        for (int i = 0; i < testTime; i++) {
            int[] arr1 = generateRandomArray(maxSize, maxValue);
            int[] arr2 = copyArray(arr1);
            bucketSort(arr1);
            comparator(arr2);
            if (!isEqual(arr1, arr2)) {
                succeed = false;
                printArray(arr1);
                printArray(arr2);
                break;
            }
        }
        System.out.println(succeed ? "Nice!" : "Fucking fucked!");

        int[] arr = generateRandomArray(maxSize, maxValue);
        printArray(arr);
        bucketSort(arr);
        printArray(arr);

    }
}

应用：组内最大差值

package Sort;
//比较数组中相邻两数的最大差值；
import java.util.Arrays;

public class maxGap {
    public static int MaxGap(int[] arr){
        if(arr == null || arr.length < 2){
            return 0;
        }
        int len = arr.length;
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        for(int i = 0;i < len;i++){//1.寻找数组中最大，最小值
            min = Math.min(min,arr[i]);
            max = Math.max(max,arr[i]);
        }
        if(min == max){//数组中元素一样，直接返回零可以节省运行时间
            return 0;
        }
        boolean[] hasNum = new boolean[len + 1];//判定桶内是否含有元素
        int[] maxs = new int[len + 1];//桶内元素的最大值
        int[] mins = new int[len + 1];//桶内元素的最小值
        int bid = 0;
        for(int i = 0;i < len;i++){//
            bid = bucket(arr[i],len,min,max);
            mins[bid] = hasNum[bid] ? Math.min(mins[bid],arr[i]):arr[i];
            maxs[bid] = hasNum[bid] ? Math.max(maxs[bid],arr[i]):arr[i];
            hasNum[bid] = true;
        }
        int res = 0;
        int lastMax = maxs[0];
        int i = 1;
        for(;i <= len;i++){
            if(hasNum[i]){
                res = Math.max(res,mins[i] - lastMax);
                lastMax = maxs[i];
            }
        }
        return res;
    }
    public static int bucket(long num,long len,long min,long max){//判断num属于第几号桶
        return (int)((num - min) * len /(max - min));
    }
    public static int comparator(int[] arr){
        if(arr == null || arr.length < 2){
            return 0;
        }
        Arrays.sort(arr);
        int gap = Integer.MIN_VALUE;
        for(int i = 1;i < arr.length;i++){
            gap = Math.max(arr[i] - arr[i - 1],gap);
        }
        return gap;
    }
    public static int[] generateRandomArray(int maxSize,int maxValue){
        int[] arr = new int[(int)((maxSize + 1) * Math.random() )];
        for(int i = 0;i < arr.length;i++){
            arr[i] = (int)((maxValue + 1) * Math.random()) -(int)((maxValue) * Math.random());
        }
        return arr;
    }
    public static int[] copyArray(int[] arr) {
        if (arr == null) {
            return null;
        }
        int[] res = new int[arr.length];
        for (int i = 0; i < arr.length; i++) {
            res[i] = arr[i];
        }
        return res;
    }

    // for test
    public static void main(String[] args) {
        int testTime = 500000;
        int maxSize = 100;
        int maxValue = 100;
        boolean succeed = true;
        long start = System.currentTimeMillis();
        for (int i = 0; i < testTime; i++) {
            int[] arr1 = generateRandomArray(maxSize, maxValue);
            int[] arr2 = copyArray(arr1);
            if (MaxGap(arr1) != comparator(arr2)) {
                succeed = false;
                break;
            }
        }
        long end = System.currentTimeMillis();
        System.out.println("last time :" + (end - start) + "ms");
        System.out.println(succeed ? "Nice!" : "Fucking fucked!");
    }

}

7.选择排序

package Sort;

import java.util.Arrays;

public class selectionSort {
    public static void SelectionSort(int []arr){
        if(arr == null && arr.length < 2){
            return;
        }
        for(int i = 0;i < arr.length;i++){
            int miIndex = i;
            for(int j = i + 1;j < arr.length;j++){
                miIndex = arr[j] < arr[miIndex] ? j:miIndex;
            }
            swap(arr,i,miIndex);
        }
    }
    public static void swap(int []arr,int i,int j){
        int tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp;
    }
    public static void comparator(int []arr){
        Arrays.sort(arr);
    }
    public static int[] generateRandomArray(int maxSize,int maxValue){
        int[] arr = new int[(int)((maxSize + 1)*Math.random())];
        for(int i = 0;i < arr.length;i++){
            arr[i] = (int)((maxValue + 1) * Math.random()) - (int)((maxValue) * Math.random());
        }
        return arr;
    }

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

        }
        return true;


    }
    public static void printArray(int[] arr){
        if(arr == null){
            return;
        }
        for(int i = 0;i < arr.length;i++){
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    public static void main(String[] args) {
        int times = 100000;
        int maxSize = 100;
        int maxValue = 100;
        boolean succeed = true;
        for(int i = 0;i < times;i++){
            int[] arr1 = generateRandomArray(maxSize,maxValue);
            int[] arr2 = copyArray(arr1);
            SelectionSort(arr1);
            comparator(arr2);
            if (!isEqual(arr1,arr2)){
                succeed = false;
                break;
            }
        }
        System.out.println(succeed ? "nice!":"shit!");

        int[] arr = generateRandomArray(maxSize,maxValue);
        printArray(arr);
        SelectionSort(arr);
        printArray(arr);
    }
}