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.         self.quickSort(l, h, nums)
    7.         return nums
    9.     def mergeSort(self, l, h, nums):
    10.         if l < h:
    11.             mid = (l + h) // 2
    12.             self.mergeSort(l, mid, nums)
    13.             self.mergeSort(mid+1, h, nums)
    15.             i = l
    16.             j = mid + 1
    17.             mergeArray = []
    18.             while i < mid + 1 and j < h + 1:
    19.                 if nums[i] < nums[j]:
    20.                     mergeArray.append(nums[i])
    21.                     i += 1
    22.                 else:
    23.                     mergeArray.append(nums[j])
    24.                     j += 1
    25.             while i < mid + 1:
    26.                 mergeArray.append(nums[i])
    27.                 i += 1
    29.             while j < h + 1:
    30.                 mergeArray.append(nums[j])
    31.                 j += 1
    32.             #print(mergeArray)
    33.             #print(nums[l:(h+1)])
    34.             nums[l:(h+1)] = mergeArray
    37.     def quickSort(self, l, h, nums):
    38.         if l < h:
    39.             j = self.partition(l, h, nums)
    40.             #print(j)
    41.             #print(nums)
    42.             self.quickSort(l, j - 1, nums)
    43.             self.quickSort(j+1, h, nums)
    44.     def partition(self, l, h, nums):
    45.         if l > h:
    46.             return None
    47.         pivot = nums[l]
    48.         i = l
    49.         j = h
    50.         while i < j:
    51.             while nums[i] <= pivot and i < h:
    52.                 i += 1
    53.             while nums[j] > pivot and j >= l:
    54.                 j -= 1
    55.             if i < j:
    56.                 temp = nums[i]
    57.                 nums[i] = nums[j]
    58.                 nums[j] = temp
    59.         nums[l] = nums[j]
    60.         nums[j] = pivot
    61.         return j