数组中的第K个最大元素

class Solution {
    public int findKthLargest(int[] nums, int k) {
       quickSort(nums,0,nums.length-1);
	   for (int i : nums) {
		 System.out.println(i);
		}
       return nums[nums.length-k];
    }

    private static void quickSort(int[] arr,int low,int high){
        if(low= tmp){
                high--;
            }
            arr[low]=arr[high];
            while(low