python排序--快速排序

写在最前面：

 

一种非常简洁的花里胡哨的写法：

def qsort(L):
    if len(L) <= 1:
        return L
    return qsort([lt for lt in L[1:] if lt < L[0]]) + L[0:1]+ qsort([ge for ge in L[1:] if ge >= L[0]])

iList = [0,1,43,92,112,9,333,91,635,32,44,74,1,74,23,89,33,1,0]
print(qsort(iList))

 

很常规的写法：

def quick_sort(alist, start, end):
    if start >= end:
        # 退出递归
        return
    pivot = alist[start]
    right = end
    left = start

    # 控制right -= 1不满足条件交换
    while left < right:
        while left < right and alist[right] > pivot:
            right -= 1

        # 交换
        alist[left] = alist[right]
        
        # 控制 left += 1 , 不满足条件交换
        while left < right and alist[left] <= pivot:
            left += 1
        alist[right] = alist[left]

    # 退出循环 left = right
    # left 或者 right 对应的位置 赋值为基准值
    alist[left] = pivot

    # 递归自己调用自己
    quick_sort(alist, start, left - 1)  # 对左边排序
    quick_sort(alist, left + 1, end)  # 对右边排序


if __name__ == '__main__':
    li = [0,1,43,92,112,3,3,5,6,5465,233,2,34,6,45,1]
    quick_sort(li, 0, len(li) - 1)
    print(li)