Python clean Quicksort
\nclass Solution(object):\n    def sortArray(self, nums):\n        self.quickSort(nums, 0, len(nums)-1)\n        return nums\n\n    def quickSort(self, nums, st
```\nclass Solution(object):\n    def sortArray(self, nums):\n        self.quickSort(nums, 0, len(nums)-1)\n        return nums\n\n    def quickSort(self, nums, start, end):\n        if end <= start:\n            return\n        mid = (start + end) // 2\n        nums[start], nums[mid] = nums[mid], nums[start]\n        i = start + 1\n        j = end\n        while i <= j:\n            while i <= j and nums[i] <= nums[start]:\n                i += 1\n            while i <= j and nums[j] >= nums[start]:\n                j -= 1\n            if i < j:\n                nums[i], nums[j] = nums[j], nums[i]        \n        nums[start], nums[j] = nums[j], nums[start]\n        self.quickSort(nums, start, j-1)\n        self.quickSort(nums, j+1, end)\n```
['Python']