希尔排序 快速排序 归并排序 堆排序 计数排序 桶排序 基数排序代码实现举例

希尔排序：

def shell_sort(arr):
    n = len(arr)
    gap = n // 2
    while gap > 0:
        for i in range(gap, n):
            temp = arr[i]
            j = i
            while j >= gap and arr[j-gap] > temp:
                arr[j] = arr[j-gap]
                j -= gap
            arr[j] = temp
        gap //= 2
    return arr

快速排序：

def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    return quick_sort(left) + middle + quick_sort(right)

归并排序：

def merge_sort(arr):
    if len(arr) <= 1:
        return arr
    mid = len(arr) // 2
    left = merge_sort(arr[:mid])
    right = merge_sort(arr[mid:])
    return merge(left, right)

def merge(left, right):
    result = []
    i, j = 0, 0
    while i < len(left) and j < len(right):
        if left[i] < right[j]:
            result.append(left[i])
            i += 1
        else:
            result.append(right[j])
            j += 1
    result += left[i:]
    result += right[j:]
    return result

堆排序：

def heapify(arr, n, i):
    largest = i 
    l = 2 * i + 1     
    r = 2 * i + 2    
    if l < n and arr[i] < arr[l]:
        largest = l
    if r < n and arr[largest] < arr[r]:
        largest = r
    if largest != i:
        arr[i],arr[largest] = arr[largest],arr[i] 
        heapify(arr, n, largest)

def heap_sort(arr):
    n = len(arr)
    for i in range(n//2 - 1, -1, -1):
        heapify(arr, n, i)
    for i in range(n-1, 0, -1):
        arr[i], arr[0] = arr[0], arr[i] 
        heapify(arr, i, 0)
    return arr

计数排序：

def counting_sort(arr):
    max_value = max(arr)
    counts = [0] * (max_value + 1)
    result = [0] * len(arr)
    for x in arr:
        counts[x] += 1
    for i in range(1, max_value + 1):
        counts[i] += counts[i-1]
    for i in range(len(arr)):
        result[counts[arr[i]] - 1] = arr[i]
        counts[arr[i]] -= 1
    return result

桶排序：

def bucket_sort(arr):
    max_value = max(arr)
    bucket_size = max_value // 10
    num_buckets = max_value // bucket_size + 1
    buckets = [[] for _ in range(num_buckets)]
    for x in arr:
        buckets[x // bucket_size].append(x)
    result = []
    for bucket in buckets:
        result.extend(sorted(bucket))
    return result

基数排序：

def radix_sort(arr):
    max_value = max(arr)
    digit_count = len(str(max_value))
    for digit in range(digit_count):
        buckets = [[] for _ in range(10)]
        for x in arr:
            bucket_index = (x // (10 ** digit)) % 10
            buckets[bucket_index].append(x)
        arr = []
        for bucket in buckets:
            arr.extend(bucket)
    return arr