快排

def quick_sort1(nums):
        if len(nums)<=1:
                return nums
        piv=nums[0]
        pre_nums=[ k for k in nums if k<piv ]
        aft_nums=[ k for k in nums if k>piv ]
        zz=[ k for k in nums if k==piv ]
        return quick_sort1(pre_nums)+zz+quick_sort1(aft_nums)

arr=[2,1,55,21,32,100,1,2]
a=quick_sort1(arr)
print(a)