1. class Solution:
    2.     def sortArray(self, nums: List[int]) -> List[int]:
    3.         l = 0
    4.         h = len(nums) - 1
    5.         self.mergeSort(l, h, nums)
    6.         return nums
    8.     def mergeSort(self, l, h, nums):
    9.         if l < h:
    10.             mid = (l + h) // 2
    11.             self.mergeSort(l, mid, nums)
    12.             self.mergeSort(mid+1, h, nums)
    14.             i = l
    15.             j = mid + 1
    16.             mergeArray = []
    17.             while i < mid + 1 and j < h + 1:
    18.                 if nums[i] < nums[j]:
    19.                     mergeArray.append(nums[i])
    20.                     i += 1
    21.                 else:
    22.                     mergeArray.append(nums[j])
    23.                     j += 1
    24.             while i < mid + 1:
    25.                 mergeArray.append(nums[i])
    26.                 i += 1
    28.             while j < h + 1:
    29.                 mergeArray.append(nums[j])
    30.                 j += 1
    31.             print(mergeArray)
    32.             #print(nums[l:(h+1)])
    33.             nums[l:(h+1)] = mergeArray
    36.     def quickSort(self,)