Python quicksort
\n\nclass Solution:\n    def sortArray(self, nums: List[int]) -> List[int]:\n        self.quicksort(nums, 0, len(nums) - 1)\n        return nums\n    \n    def 
\n```\nclass Solution:\n    def sortArray(self, nums: List[int]) -> List[int]:\n        self.quicksort(nums, 0, len(nums) - 1)\n        return nums\n    \n    def quicksort(self, nums, lower, upper):\n        if lower < upper:\n            pivot = self.partition(nums, lower, upper)\n            self.quicksort(nums, lower, pivot - 1)\n            self.quicksort(nums, pivot + 1, upper)\n        else:\n            return\n        \n    def partition(self, nums, lower, upper):\n        \n        pivot = nums[upper]\n        \n        i = lower\n        \n        for j in range(lower, upper):\n            if nums[j] < pivot:\n                nums[i], nums[j] = nums[j], nums[i]\n                i += 1\n                \n        nums[i], nums[upper] = nums[upper], nums[i]\n        \n        return i\n```
[]