题解 | 【模板】排序

n = int(input())
my_list = [int(x) for x in input().split()]
def quick_sort(my_list,start,end):
    if start >= end:
        return
    left = start
    right = end
    mid = my_list[start]
    while left < right:
        while my_list[right] >= mid and left < right:
            right -= 1
        my_list[left] = my_list[right]
        while my_list[left] < mid and left < right:
            left += 1
        my_list[right] = my_list[left]
    my_list[left] = mid
    quick_sort(my_list,start,left-1)
    quick_sort(my_list,right+1,end)

if __name__ == '__main__':
    

    quick_sort(my_list,0,n-1)
    for num in my_list:
        print(num, end=" ")