快速排序（Java代码实现）

public class Paixu {
    public static void main(String[] args) {
        int[] arr = new int[]{9, 8, 7, 6, 5, 4, 3, 2, 1};
        KuaiSu(arr, 0, arr.length - 1);
        System.out.println(Arrays.toString(arr));
    }
    
    public static void KuaiSu(int[] arr, int left, int right) {
        if (left >= right) {
            return;
        }
        int pivot = arr[left];
        int i = left;
        int j = right;
        while (i < j) {
            while (i < j && arr[j] > pivot) {
                j--;
            }
            if (i < j) {
                arr[i++] = arr[j];
            }


            while (i < j && arr[i] <= pivot) {
                i++;
            }
            if (i < j) {
                arr[j--] = arr[i];
            }
        }
        arr[i] = pivot;
        KuaiSu(arr, left, i - 1);
        KuaiSu(arr, i + 1, right);
    }
}