python代码实现快速排序

最新推荐文章于 2023-02-17 22:49:03 发布

xlh_hzw

最新推荐文章于 2023-02-17 22:49:03 发布

阅读量158

点赞数

分类专栏： python

本文链接：https://blog.csdn.net/weixin_43095456/article/details/99131668

版权

python 专栏收录该内容

130 篇文章 1 订阅

订阅专栏

def quick_sort(alist, first, last):
    '''快速排序'''
    if first >= last:
        return alist
    else:
        mid_value = alist[first]
        low = first
        high = last
        while low < high:
            while low < high and alist[high] >= mid_value:
                high -= 1
            alist[low] = alist[high]
            while low < high and alist[low] < mid_value:
                low += 1
            alist[high] = alist[low]
        alist[low] = mid_value
    #low左边的排序
    quick_sort(alist, first, low-1)
    #low右边的排序
    quick_sort(alist, low+1, last)

if __name__ == '__main__':
    li = [1, 0, 6, 20, -9, 95, -50, 87]
    print(li)
    quick_sort(li, 0, len(li)-1)
    print(li)

C:\Users\user\AppData\Local\Programs\Python\Python36\python.exe “C:/Users/user/PycharmProjects/hellow python/test.py”
[1, 0, 6, 20, -9, 95, -50, 87]
[-50, -9, 0, 1, 6, 20, 87, 95]

Process finished with exit code 0