排序——快速排序

https://blog.csdn.net/nrsc272420199/article/details/82587933

https://blog.csdn.net/A_BlackMoon/article/details/81064712

def quick_sort(lists, left, right):
    """快排"""
    if left >= right:
        return lists

    key = lists[left]
    low = left
    high = right

    while left < right:
        while left < right and key <= lists[right]:
            right -= 1
        lists[left] = lists[right]

        while left < right and key >= lists[left]:
            left += 1
        lists[right] = lists[left]

    lists[right] = key

    quick_sort(lists, low, left-1)
    quick_sort(lists, left+1, high)
    return lists


if __name__ == '__main__':
    list = [3, 4, 2, 8, 9, 5, 1]
    for ele in list:
        print(ele, end=" ")
    print("\n")
    for ele in quick_sort(list, 0, len(list)-1):
        print(ele, end=" ")

 

快速排序和归并排序的比较：https://blog.csdn.net/n_sev7/article/details/78060656