<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]:
        nums = [[x] for x in nums]
        while len(nums) > 1:
            new_nums = []
            for i in range(0, len(nums), 2):
                left_list = nums[i]
                right_list = nums[i + 1] if i + 1 < len(nums) else []
                left_cursor = right_cursor = 0
                ret = []
                while left_cursor < len(left_list) and right_cursor < len(right_list):
                    if left_list[left_cursor] < right_list[right_cursor]:
                        ret.append(left_list[left_cursor])
                        left_cursor += 1
                    else:
                        ret.append(right_list[right_cursor])
                        right_cursor += 1
                ret.extend(left_list[left_cursor:])
                ret.extend(right_list[right_cursor:])
                new_nums.append(ret)
            nums = new_nums

        return nums[0]

29885