<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 merge(arr, st,mid,end):
            temp=[0] *(end-st+1)
            i =st
            j = mid+1
            k=0

            while i<=mid and j<=end:
                if arr[i]<=arr[j]:
                    temp[k]=arr[i]
                    i+=1
                else :
                    temp[k]=arr[j]
                    j+=1
                k+=1

            while i <= mid:
                temp[k] = arr[i]
                i += 1
                k += 1
            
            while j <= end:
                temp[k] = arr[j]
                j += 1
                k += 1

            for i in range(len(temp)):
                arr[st + i] = temp[i]

            
        def mergesort(arr, st, end):
            if st==end:
                return arr
            mid = (st+end)//2
            mergesort(arr,st,mid)
            mergesort(arr,mid+1,end)
            merge(arr,st, mid,end)
        

        mergesort(nums, 0, len(nums) - 1)
        return nums
        
        
22325