java快速排序代码demo

以下是Java实现的快速排序代码demo：

public class QuickSort {
    public static void main(String[] args) {
        int arr[] = {5, 3, 6, 1, 9, 0};
        //打印排序前数组
        System.out.println("排序前：");
        printArr(arr);
        //打印排序过程
        System.out.println("\n快速排序过程：");
        quickSort(arr, 0, arr.length-1);
        //打印排序后数组
        System.out.println("\n排序后：");
        printArr(arr);
    }

    public static void quickSort(int[] arr, int left, int right){
        if(left >= right){
            return;
        }
        int pivot = partition(arr, left, right);
        quickSort(arr, left, pivot-1);
        quickSort(arr, pivot+1, right);
    }

    public static int partition(int[] arr, int left, int right){
        int pivot = arr[left];
        int i = left, j = right;
        while(i < j){
            while(i < j && arr[j] >= pivot){
                j--;
            }
            arr[i] = arr[j];
            while(i < j && arr[i] <= pivot){
                i++;
            }
            arr[j] = arr[i];
        }
        arr[i] = pivot;
        return i;
    }

    public static void printArr(int[] arr){
        for(int k=0; k<arr.length; k++){
            System.out.print(arr[k]);
            System.out.print(" ");
        }
        System.out.println();
    }
}