<p>Given an array of integers <code>nums</code>, sort the array in ascending order and return it.</p>

<p>You must solve the problem <strong>without using any built-in</strong> functions in <code>O(nlog(n))</code> time complexity and with the smallest space complexity possible.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [5,2,3,1]
<strong>Output:</strong> [1,2,3,5]
<strong>Explanation:</strong> After sorting the array, the positions of some numbers are not changed (for example, 2 and 3), while the positions of other numbers are changed (for example, 1 and 5).
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [5,1,1,2,0,0]
<strong>Output:</strong> [0,0,1,1,2,5]
<strong>Explanation:</strong> Note that the values of nums are not necessairly unique.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

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

class Solution {
public:
    int partition(vector<int>& nums, int p, int r){
        int x = nums[r];
        int j = p;
        for (int i = p; i <r; i++)
        {
            if ( nums[i] < x)
            {
                if(j<i)
                {
                    swap(nums[i], nums[j]);
                }
                
                j += 1;
            }
        }
        swap(nums[j], nums[r]);
        return j;
    }
    void qs(vector<int>& nums, int p, int r)
    {
        if (p < r)
        {
            swap(nums[r], nums[p + rand() % (r -p + 1)]);
            int pivot = partition(nums, p ,r);
            qs(nums, p,pivot-1);
            qs(nums, pivot+1, r);
        }
    }
    vector<int> sortArray(vector<int>& nums) {
       qs(nums, 0, nums.size()-1);
       return nums;
    }

};
70568