def findKthLargest(self, nums, k):
    random.shuffle(nums)
    return self.quickSelection(nums, 0, (len(nums) - 1), (len(nums) - k))
def findKthLargest(self, nums, k):
    random.shuffle(nums)
    return self.quickSelection(nums, 0, (len(nums) - 1), (len(nums) - k))