python实现排序

交换排序

冒泡排序

def bubble_sort1(arr):
    for i in range(len(arr)-1):
        for j in range(len(arr)-1-i):
            if arr[j] > arr[j+1]:
                arr[j] , arr[j+1] = arr[j+1], arr[j]
    return arr

快速排序

def quick_sort(arr,low,high):
    i = low
    j = high
    temp = arr[low]
    if i >= j:
        return arr
    while i < j:
        while arr[j] >= temp and i < j:
            j = j-1
        arr[i] = arr[j]
        while arr[i] <= temp and i < j:
            i = i+1
        arr[j] = arr[i]
    arr[i] = temp
    quick_sort(arr,low,i-1)
    quick_sort(arr,i+1,high)
    return arr

算法导论-快速排序实现

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 quick_sort(arr, low, high):
    if low < high:
        pi = partition(arr, low, high)
        quick_sort(arr, low, pi - 1)
        quick_sort(arr, pi + 1, high)
    return arr