[排序]快速排序

class Solution:
    def sortArray(self, nums: List[int]) -> List[int]:

        def quicksort(nums):
            if not nums:
                return []

            pivot = random.choice(nums)

            less = []
            equal = []
            bigger = []

            for n in nums:
                if n < pivot:
                    less.append(n)
                if n == pivot:
                    equal.append(n)
                if n> pivot:
                    bigger.append(n)

            return quicksort(less) + equal + quicksort(bigger)
            
        return quicksort(nums)