<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]:
        if len(nums) < 2:
            return nums

        def helper(left: int, right: int):
            if right - left == 0:
                return

            m = left + (right - left) // 2

            helper(left, m)
            helper(m + 1, right)

            i = 0
            j = 0
            k = left

            temp_left = nums[left:m + 1]
            temp_right = nums[m + 1:right + 1]

            while i < len(temp_left) and j < len(temp_right):
                if temp_left[i] <= temp_right[j]:
                    nums[k] = temp_left[i]
                    i += 1
                else:
                    nums[k] = temp_right[j]
                    j += 1

                k += 1

            while i < len(temp_left):
                nums[k] = temp_left[i]
                i += 1
                k += 1

            while j < len(temp_right):
                nums[k] = temp_right[j]
                j += 1
                k += 1

        helper(0, len(nums) - 1)

        return nums

33875