快速排序（python）

解题思路:

注意事项:

参考代码:

def quick_sort(nums):

    if len(nums) <= 1:

        return nums

    pivot = nums[len(nums) // 2]

    left = [x for x in nums if x < pivot]

    middle = [x for x in nums if x == pivot]

    right = [x for x in nums if x > pivot]

    return quick_sort(left) + middle + quick_sort(right)

n = int(input())

nums = list(map(int, input().split()))

result = quick_sort(nums)

print(' '.join(map(str, result)))