<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]:
        split_lists = [nums[:len(nums)//2], nums[len(nums)//2:]]
        fully_split = False
        while not fully_split:
            curr_split = True
            new_lists = []
            for split in split_lists:
                half = len(split) // 2
                if len(split) > 1:
                    new_lists.append(split[:half])
                    new_lists.append(split[half:])
                    curr_split = False
                else:
                    new_lists.append(split)
            fully_split = curr_split
            split_lists = new_lists.copy()
        print(split_lists)
        while len(split_lists) > 1:
            temp_splits = []
            for i in range(0, len(split_lists), 2):
                if i == len(split_lists) - 1:
                    temp_splits.append(split_lists[i])
                    break
                left = split_lists[i]
                right = split_lists[i+1]
                temp_split = []
                while len(left) > 0 and len(right) > 0:
                    left_elem = left[0]
                    right_elem = right[0]
                    if left_elem <= right_elem:
                        temp_split.append(left_elem)
                        left.remove(left_elem)
                    else:
                        temp_split.append(right_elem)
                        right.remove(right_elem)
                if len(left) > 0:
                    temp_split.extend(left)
                if len(right) > 0:
                    temp_split.extend(right)
                temp_splits.append(temp_split)
            split_lists = temp_splits.copy()
        return split_lists[0]
32195