快速排序-python-递归

def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    mid = arr[0]
    left = []
    equal = []
    right = []
    while arr:
        element = arr[0]
        if element > mid:
            right.append(element)
        elif element < mid:
            left.append(element)
        else:
            equal.append(element)
        arr.pop(0)
    left = quick_sort(left)
    right = quick_sort(right)
    return left+equal+right