class Solution {
    public int findKthLargest(int[] nums, int k) {
        quickSort1(nums,0,nums.length-1);
        int count = 0;
        for (int i = nums.length-1;i>=0;i--){
            count++;
            if (count==k){
                return nums[i];
            }
        }
        return 0;
    }
        public static void quickSort1(int[] num,int low,int high){
        if(high<low){
            return;
        }
        int start = low;
        int end = high;
        int base = num[low];
        int t;
        while (start<end){
            while (start<end&&num[end]>=base){
                end--;
            }
            while (start<end&&num[start]<=base){
                start++;
            }
            if (start<end){
                t = num[end];
                num[end] = num[start];
                num[start] = t;
            }
        }
        num[low] = num[end];
        num [end] = base;
        quickSort1(num,low,start-1);
        quickSort1(num,start+1,high);
    }
}

老师，为什么我写的快排效率那么低啊，有什么优化的思路可以提供一下嘛