快速排序

快速排序

public class FastSort {

    public static void main(String[] args) {
        int[] array = new int[]{-1, 100, 20, 25, 90, -9, 0, 18};
        fastSortDesc(array, 0, array.length - 1);
        System.out.println(Arrays.toString(array));
        fastSortAsc(array, 0, array.length - 1);
        System.out.println(Arrays.toString(array));
    }

    /**
     * 快速排序 ： 降序
     *
     * @param array
     * @param startIndex
     * @param endIndex
     */
    public static void fastSortDesc(int[] array, int startIndex, int endIndex) {
        int left = startIndex;
        int right = endIndex;
        int mid = (left + right) / 2;
        int pivot = array[mid];
        while (left < right) {
            //直到找到左边比pivot小的值为止
            while (array[left] > pivot) {
                left++;
            }

            //直到找到右边边比pivot大的值为止
            while (array[right] < pivot) {
                right--;
            }

            if (left >= right) {
                break;
            }

            int temp = 0;
            temp = array[left];
            array[left] = array[right];
            array[right] = temp;

            if (array[left] == pivot) {
                right--;
            }

            if (array[right] == pivot) {
                left++;
            }
        }

        if (left == right) {
            left++;
            right--;
        }

        if (startIndex < right) {
            fastSortDesc(array, startIndex, right);
        }
        if (endIndex > left) {
            fastSortDesc(array, left, endIndex);
        }

    }


    /**
     * 快速排序 升序
     * @param array
     * @param startIndex
     * @param endIndex
     */
    public static void fastSortAsc(int[] array, int startIndex, int endIndex) {
        int left = startIndex;
        int right = endIndex;
        int pivot = array[(left + right) / 2];

        while (left < right) {
            //直到找到左边比pivot大的值为止
            while (array[left] < pivot) {
                left ++;
            }
            
            //直到找到右边比pivot小的值为止
            while (array[right] > pivot) {
                right --;
            }

            if (left >= right) {
                break;
            }

            //交换
            int temp = 0;
            temp = array[left];
            array[left] = array[right];
            array[right] = temp;

            if (array[left] == pivot) {
                right --;
            }

            if (array[right] == pivot) {
                left ++;
            }
        }

        if (left == right) {
            left++;
            right--;
        }

        if (startIndex < right) {
            fastSortAsc(array, startIndex, right);
        }

        if (endIndex > left) {
            fastSortAsc(array, left, endIndex);
        }
    }
}