<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:
    def sortArray(self, nums: List[int]) -> List[int]:

        def qsort(nums, low, high):
            
            #If low > high, then there are zero elements
            #If low == high, then there is one element
            if low < high:

                pivot = partition(nums, low, high)

                qsort(nums, low, pivot-1)
                qsort(nums, pivot, high)
        
        def partition(nums, low, high):

            pivot = nums[low + ((high-low)//2)]

            while low <= high:
                # While encountering elements in correct place, keep going right
                while nums[low] < pivot:
                    low += 1
                
                # While encountering elements in the correct place, keep going left
                while nums[high] > pivot:
                    high -= 1

                # If the left side and right side have not yet been portioned correctly, swap them to correct places
                if low <= high:
                    nums[low], nums[high] = nums[high], nums[low]
                    low += 1
                    high -= 1
            
            return low
        
        qsort(nums, 0, len(nums)-1)
        return nums


27575