<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the</em> <code>k<sup>th</sup></code> <em>largest element in the array</em>.</p>

<p>Note that it is the <code>k<sup>th</sup></code> largest element in the sorted order, not the <code>k<sup>th</sup></code> distinct element.</p>

<p>Can you solve it without sorting?</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [3,2,1,5,6,4], k = 2
<strong>Output:</strong> 5
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [3,2,3,1,2,4,5,5,6], k = 4
<strong>Output:</strong> 4
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution
{
public:
    int quickSort(vector<int> &nums, int start, int end, int k)
    {
        if (start > end)
            return -1;
        if (start == end)
            return nums[k];

        int pivot = nums[end];
        int l = start;
        for (int i = start; i < end; i++)
        {
            if (nums[i] < pivot)
            {
                swap(nums[i], nums[l]);
                l++;
            }
        }
        swap(nums[l], nums[end]);
        if (k == l)
            return pivot;
        if (k < l)
            return quickSort(nums, start, l - 1, k);
        return quickSort(nums, l + 1, end, k);
    }
    int findKthLargest(vector<int> &nums, int k)
    {

        int n = nums.size(); // k=4
        return quickSort(nums, 0, n - 1, n - k);
    }
};

57800