python打卡第一天快速排序

n =int(input())#类型转化
nums =list(map(int, input().split()))
 
def quick_sort(q, l, r):
    #分治
    if l >= r:
        return
    x = q[(l+r)//2]
    i, j = l-1, r+1#i j双指针
    while i < j:
        while True:
            i+=1
            if q[i]>=x:
                break
        while True:
            j-=1
            if q[j]<=x:
                break
        if i < j:
            q[i], q[j] = q[j], q[i]
    quick_sort(q, l, j)#递归调用
    quick_sort(q, j+1, r)
 
quick_sort(nums, 0, n-1)
for x in nums:
    print(x, end = ' ')