python-递归实现快速排序

lst = [1,3,5,7,9,2,4,6,8,10]

def quick_sort(lst):
    if len(lst) < 2:
        return lst
    else:
        pivot = lst[0]
        small_lst = [I for I in lst[1:] if I < pivot]
        large_lst = [J for J in lst[1:] if J > pivot]
        return quick_sort(small_lst) + [pivot] + quick_sort(large_lst)

print(quick_sort(lst))