java实现快速排序算法

快速排序算法示例代码：

public static void main(String[] args) {
        int [] arr = {42,15,35,78,24,6,9,10};
        QKSourt(arr,0,arr.length-1);
    }
    private static void QKSourt(int[] arr, int start, int end) {
        if (arr.length < 0){
            return ;
        }
        if (start >= end){
            return ;
        }
        int left = start;
        int right = end;
        int temp = arr[left];
        while (left < right){
            while (left < right && arr[right] > temp){
                right -- ;
            }
            arr[left] = arr[right];
            while (left < right && arr[left] <= temp){
                left ++ ;
            }
            arr[right] = arr[left];
        }
        arr[left] = temp;
        System.out.println(Arrays.toString(arr));
        QKSourt(arr, start, left -1);
        QKSourt(arr,left+1,end);
    }