撸袖子敲python算法之快速排序（手敲）

python快速排序

# 快速排序方法
def partition(li, left, right):
    tmp = li[left]
    while left < right:
        while left < right and li[right] >= tmp:
            right -= 1
        li[left] = li[right]
        while left < right and li[left] < tmp:
            left += 1
        li[right] = li[left]
    li[left] = tmp
    return left


# 快速排序主函数
def quick_sort(li, left, right):  #
    if right > left:
        mid = partition(li, left, len(li) - 1)
        partition(li, mid + 1, right)
        partition(li, left, mid - 1)
        return li

def quick_sort(arr):
    """快速排序"""
    if len(arr) < 2:
        return arr
    # 选取基准，随便选哪个都可以，选中间的便于理解
    mid = arr[len(arr) // 2]
    # 定义基准值左右两个数列
    left, right = [], []
    # 从原始数组中移除基准值
    arr.remove(mid)
    for item in arr:
        # 大于基准值放右边
        if item >= mid:
            right.append(item)
        else:
            # 小于基准值放左边
            left.append(item)
    # 使用迭代进行比较
    return quick_sort(left) + [mid] + quick_sort(right)

还有一种

def partition(arr, low, high):  # 分割
    i = (low - 1)  # 最小元素的索引
    pivot = arr[high] 
    for j in range(low, high):
        # 当前元素小于或等于pivot
        if arr[j] <= pivot:
            i = i + 1
            arr[i], arr[j] = arr[j], arr[i]
    arr[i + 1], arr[high] = arr[high], arr[i + 1]
    return (i + 1)


def QuickSort(arr, low, high):  # 快速排序
    if low < high:  # 当起始索引小于末端索引
        pi = partition(arr, low, high)
        QuickSort(arr, low, pi - 1)
        QuickSort(arr, pi + 1, high)


arr = [1, 2, 34, 4, 5, 65, 6, 7, 78]
n = len(arr)
QuickSort(arr, 0, n)  # >>arr需要排序的列表, 0 起始索引, n数组长度 #
for i in range(n):
    print("{}".format(arr[i]))