算法与数据结构基础学习三（快速排序）

partition过程

public static int partition(int[] arr,int L,int R){
        if (L>R){
            return -1;
        }
        if (L == R){
            return L;
        }
        int lessEqual = L-1;
        int index = L;
        while (index <R){
            if (arr[index] <= arr[R]){
                swap(arr,index,++lessEqual);
            }
            index++;
        }
        swap(arr,++lessEqual,R);
        return lessEqual;
    }
private static void swap(int[] arr, int i, int j) {
        int tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp;
    }

荷兰国旗问题

// arr[L...R] 玩荷兰国旗问题的划分，以arr[R]做划分值
    // <arr[R] ==arr[R] > arr[R]
    public static int[] netherlandsFlag(int[] arr,int L,int R){
        if (L >R){
            return new int[] {-1,-1};
        }
        if (L == R){
            return  new int[] {L,R};
        }
        int less = L -1;//小于区 右边界
        int more = R; // 大于区 左边界
        int index = L;
        while (index < more){  // 当前位置，不能和 >区的左边界撞上
            if (arr[index] == arr[R]){
                index++;
            }else if (arr[index] < arr[R]){
                swap(arr,index++,++less); //小于区加1个
            }else {
                swap(arr,index,--more); //大于去加1个
            }
        }
        swap(arr,more,R);
        return new int[] {less+1,--more};
    }

快速排序1.0

//快排1.0
    public static void quickSort1(int[] arr){
        if (arr == null || arr.length <2){
            return;
        }
        process1(arr,0,arr.length-1);
    }

    //用递归的方式排序
    private static void process1(int[] arr, int L, int R) {
        if (L >R){
            return;
        }
        int M = partition(arr,L,R); //找到一个中间位置，左边小于 右边大于
        process1(arr,L,M-1);
        process1(arr,M+1,R);
    }

快速排序2.0

 public static void quickSort2(int[] arr){
        if (arr == null || arr.length < 2){
            return;
        }
        process2(arr,0,arr.length-1);
    }

    //arr[L。。R] 排有序,快排2.0
    private static void process2(int[] arr, int L, int R) {
        if (L > R){
            return;
        }
        int[] equalArea = netherlandsFlag(arr,L,R); //随机找到中间几个数  左边的小于 右边的大于
        process2(arr,L,equalArea[0] -1);
        process2(arr,equalArea[1] + 1,R);
    }

快排3.0

//快排3.0  随机快排+荷兰国旗技巧优化
    public static void quickSort3(int[] arr){
        if (arr == null || arr.length < 2){
            return;
        }
        process3(arr,0,arr.length-1);
    }

    private static void process3(int[] arr, int L, int R) {
        if (L >= R){
            return;
        }
        swap(arr,L+(int)(Math.random()*(R-L+1)),R);
        int[] equalArea = netherlandsFlag(arr,L,R);
        process3(arr,L,equalArea[0] -1);
        process3(arr,equalArea[1]+1,R);
    }



    // 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();
    }

    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);
            int[] arr3 = copyArray(arr1);
            quickSort1(arr1);
            quickSort2(arr2);
            quickSort3(arr3);
            if (!isEqual(arr1, arr2) || !isEqual(arr2, arr3)) {
                succeed = false;
                break;
            }
        }
        System.out.println(succeed ? "Nice!" : "Oops!");

    }

—from 左程云算法基础课