# LeetCode
# 215. Kth Largest Element in an Array
#
# QuickSort
# Partitioning


def findKthLargesthelper(nums, k, start, end):
    pass


def findKthLargest(self, nums, k):
    return findKthLargesthelper(nums, k, start, end) \
 \
    def findKthLargesthelper(self, nums, k, start, end):
        pass
