<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 bubbleSort(nums:List[int]):
            for i in range(len(nums) - 1):
                for j in range(i + 1, len(nums)):
                    if nums[i] > nums[j]:
                        nums[i], nums[j] = nums[j], nums[i]
            return nums

    
        def mergeSort(nums: List[int]):
            # can I put this function below
            def merge(nums1: List[int], nums2:List[int]) -> List[int]:
                if len(nums1) == 0:
                    return nums2
                if len(nums2) == 0:
                    return nums1
                ret = [0] * (len(nums1) + len(nums2))
                i = 0
                j = 0
                while i < len(nums1) and j < len(nums2):
                    if nums1[i] < nums2[j]:
                        ret[i + j] = nums1[i]
                        i += 1
                    else:
                        ret[i + j] = nums2[j]
                        j += 1
                while i < len(nums1):
                   # print("len:" + str(len(ret)) + ", i+j:" + str(i+j))
                    ret[i + j] = nums1[i]
                    i += 1
                while j < len(nums2):
                    ret[i + j] = nums2[j]
                    j += 1
                return ret

                if len(nums) <= 1:
                    return nums


         #   print(nums)
            if len(nums) <= 1:
                return nums
#            print("left", end=" ")
            left = mergeSort(nums[:len(nums) // 2])
#            print("right", end=" ")
            right = mergeSort(nums[len(nums) // 2:])
            return merge(left, right)


        def samTest(nums: List[int]) -> List[int]:
            dico = defaultdict(int)
            res = []
            for i in range(len(nums)):
                dico[nums[i]] += 1
            for i in range(-50001,50001):
                if dico[i] > 0:
                    res += [i] * dico[i] 
            return res
  #      return bubbleSort(nums)
        # return mergeSort(nums)
        return samTest(nums)
35345