python—15、排序算法

• 场景
• • 1、快排实现

def quickSort(v_list):
    if len(v_list) <= 1:
        return v_list
    pivot = v_list[0]
    less = [x for x in v_list[1:] if x <= pivot]
    greater = [y for y in v_list[1:] if y > pivot]
    return quickSort(less) + [pivot] + quickSort(greater)


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