<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]:
        self.mergeSort(nums, 0, len(nums) - 1)
        return nums

    def merge(self, array: List[int], left: int, mid: int, right: int) -> None:
        n = mid - left + 1
        m = right - mid

        L = array[left:left + n]
        R = array[mid + 1:mid + 1 + m]

        i = 0
        j = 0
        k = left

        while i < n and j < m:
            if L[i] <= R[j]:
                array[k] = L[i]
                i += 1
            else:
                array[k] = R[j]
                j += 1
            
            k += 1

        while i < n:
            array[k] = L[i]
            i += 1
            k += 1

        while j < m:
            array[k] = R[j]
            j += 1
            k += 1

    def mergeSort(self, array: List[int], left: int, right: int) -> None:
        if left < right:
            mid = (left + right) // 2

            self.mergeSort(array, left, mid)
            self.mergeSort(array, mid + 1, right)

            self.merge(array, left, mid, right)
23165