python 排序之 快速排序

def quick_sort(arr):    if len(arr) <= 1:        return arr    m = arr[0]    small_list = []    big_list = []    for i in arr[1:]:        if i < m:            small_list.append(i)        else:            big_list.append(i)    return quick_sort(small_list) + [m] + quick_sort(big_list)L = [1,22,5,7,19,3,78,4,11,45,23]print(quick_sort(L))