leetcode 912

class Solution:
    def sortArray(self, nums: List[int]) -> List[int]:
        self.quickSort(nums, 0, len(nums)-1)
        return nums

    def quickSort(self, nums, left, right):
        left = 0 if not isinstance(left, int) else left
        right = len(nums)-1 if not isinstance(right, int) else right
        if left < right:
            partitionIndex = self.partition(nums, left, right)
            self.quickSort(nums, left, partitionIndex-1)
            self.quickSort(nums, partitionIndex+1, right)
        return nums
    
    def partition(self, nums, left, right):
        pivot = left
        index = pivot+1
        i = index
        while i <= right:
            if nums[i] < nums[pivot]:
                self.swap(nums, i, index)
                index+=1
            i+=1
        self.swap(nums, pivot, index-1)
        return index-1

    def swap(self, nums, i, j):
        nums[i], nums[j] = nums[j], nums[i]