快速排序

    public void quickSort(int[] nums, int left, int right){        if(left < right){            int key = nums[left];            int low = left;            int high = right;            while (low < high){                while (low < high && nums[high] > key)                    high --;                nums[low] = nums[high];                while (low < high && nums[low] < key)                    low++;                nums[high] = nums[low];            }            nums[low] = key;            quickSort(nums, left, low - 1);            quickSort(nums, low + 1, right);        }    }