Python的快速排序

#快速排序 alist要排序的元素start为起始元素
def quick_sort(alist, start, end):

if start >= end:
    return

# 设定起始元素为要寻找位置的基准元素

mid = alist[start]

# low为序列左边的由左向右移动的游标

low = start

# high为序列右边的由右向左移动的游标

high = end

while low < high:

    # 如果low与high未重合，high指向的元素不比基准元素小，则high向左移动

    while low < high and alist[high] >= mid:
        high -= 1
        alist[low] = alist[high]



    while low < high and alist[low] < mid:
        low += 1



    alist[high] = alist[low]



alist[low] = mid

# 对基准元素左边的子序列进行快速排序

quick_sort(alist, start, low - 1)

# 对基准元素右边的子序列进行快速排序

quick_sort(alist, low + 1, end)