export function findKthLargest(nums: number[], k: number): number {
  let orderNums = quickSort(nums)
  return  orderNums[k - 1]
}

function quickSort(nums: number[]) {
  if(nums.length < 2) return nums
  let pivot = nums[nums.length - 1]
  let left = []
  let rigth = []
  for(let i = 0; i < nums.length - 1; i++){
    if(nums[i] > pivot)left.push(nums[i])
    else rigth.push(nums[i])
  }
  return [...quickSort(left), pivot, ...quickSort(rigth)]
}