java实现快速排序

java实现快速排序

class QuickSort {
    public int[] quickSort(int[] array) {
        if(array == null || array.length == 0 || array.length == 1){
            return array;
        }
        sort(array, 0, array.length-1);
        
        return array;
    }

    public void sort(int[] array,left,right){
        if(left > right){
            return;
        }

        while(i != j){
            int base = array[left];
            int i = left;
            int j = right;

            while(array[j] >= base && i < j){
                j--;
            }

            while(array[i] <= base && i < j){
                i++;
            }

            int temp = array[i];
            array[i] = array[j];
            array[j] = temp;
        }
        array[left] = array[i];
        array[i] = base;

        sort(array,left,i-1);
        sort(array,i+1,right);
    }
}

递归思想