标准快速排序-python

最新推荐文章于 2025-01-04 00:37:43 发布

什么是快乐星球！？

最新推荐文章于 2025-01-04 00:37:43 发布

阅读量143

点赞数

分类专栏：数据结构与算法文章标签： python 快速排序算法面试排序算法

本文链接：https://blog.csdn.net/snail9610/article/details/118566958

版权

数据结构与算法专栏收录该内容

5 篇文章

订阅专栏

def quick_sort(alist):
    qsort(alist, 0, len(alist) - 1)
    return alist

def qsort(alist, left, right):
    if left >= right:
        return
    low = left
    high = right
    key = alist[low]
    while left < right:
        while left < right and alist[right] > key:
            right -= 1
        alist[left] = alist[right]
        while left < right and alist[left] < key:
            left += 1
        alist[right] = alist[left]
    alist[right] = key

    qsort(alist, low, left-1)
    qsort(alist, left+1, high)

alist = [30,24,5,58,18,36,12,42,39]
print(alist)
print(quick_sort(alist))