# 快速排序
def fast_sort(arr):
if len(arr)<2:
return arr
flag = arr.pop(len(arr)//2)
left = []
right = []
for i in range(len(arr)):
left.append(arr[i]) if arr[i] < flag else right.append(arr[i])
return fast_sort(left) + [flag] + fast_sort(right)