<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 mergeSort(l,lb,ub):
            if(lb==ub):
                return
            else:
                mid=(lb+ub)//2
                mergeSort(l,lb,mid)
                mergeSort(l,mid+1,ub)
                mergeList(l,lb,mid,ub)
        def mergeList(nums,lb,mid,ub):
            i=lb
            j=mid+1
            temp=[]
            while(i<=mid and j<=ub):
                if(nums[i]<=nums[j]):
                    temp.append(nums[i])
                    i+=1
                else:
                    temp.append(nums[j])
                    j+=1
            if(i>mid):
                while(j<=ub):
                    temp.append(nums[j])
                    j+=1
            elif(j>ub):
                while(i<=mid):
                    temp.append(nums[i])
                    i+=1
            for i in range(len(temp)):
                nums[lb+i]=temp[i]
        mergeSort(nums,0,len(nums)-1)
        return nums   

22955