Python 经典排序

# 冒泡排序
def sort_1(arr):
    for j in range(len(arr),0,-1):
        for i in range(j - 1):
            if arr[i] > arr[i+1]:
                arr[i],arr[i+1] = arr[i+1],arr[i]
    return arr

if __name__ == '__main__':
    arr1 = [1,5,6,7,8,4,2,5,6]
    print(sort_1(arr1))


# 选择排序
def select_sort(arr):
    n = len(arr)
    for i in range(n):
        min_index = i
        for j in range(i+1,n):
            if arr[j] < arr[min_index]:
                min_index = j
        # 将最小的值对应的索引放到最开始的位置
        tmp = arr[min_index]
        arr[min_index] = arr[i]
        arr[i] = tmp
    return arr
if __name__ == '__main__':
    arr1 = [1,5,6,7,8,4,2,5,6]
    print(select_sort(arr1))


# 插入排序
def insert_sort(arr):
    n = len(arr)
    for i in range(1,n):
        pre_index = i - 1
        current = arr[i]
        while current < arr[pre_index] and pre_index >= 0:
            arr[pre_index + 1] = arr[pre_index]
            pre_index -= 1
        # 找到插入的位置
        arr[pre_index+1] = current
    return arr
if __name__ == '__main__':
    arr1 = [1,5,6,7,8,4,2,5,6]
    print(insert_sort(arr1))

#希尔排序  减少增量排序
import numpy as np
def shell_sort(arr):
    n = len(arr)
    # 更定 shell 增量
    gap = int(np.floor(n/3) + 1)
    while gap >= 1:
        for i in range(gap,n):
            pre_index = i - gap
            current = arr[i]
            while current < arr[pre_index] and pre_index >= 0:
                arr[pre_index + gap]  =arr[pre_index]
                pre_index -= gap
            # 选择插入的位子
            arr[pre_index + gap] = current
        gap = gap//3
    return arr

if __name__ == '__main__':
    arr1 = [1,5,6,7,8,4,2,5,6]
    print(shell_sort(arr1))


# 归并排序（2路归并）

def merge(s1,s2,s):
    """将两个列表是s1，s2按顺序融合为一个列表s,s为原列表"""
    # j和i就相当于两个指向的位置，i指s1，j指s2
    i = j = 0
    while i+j<len(s):
        # j==len(s2)时说明s2走完了，或者s1没走完并且s1中该位置是最小的
        if j==len(s2) or (i<len(s1) and s1[i]<s2[j]):
            s[i+j] = s1[i]
            i += 1
        else:
            s[i+j] = s2[j]
            j += 1

def merge_sort(s):
    """归并排序"""
    n = len(s)
    # 剩一个或没有直接返回，不用排序
    if n < 2:
        return
    # 拆分
    mid = n // 2
    s1 = s[0:mid]
    s2 = s[mid:n]
    # 子序列递归调用排序
    merge_sort(s1)
    merge_sort(s2)
    # 合并
    merge(s1,s2,s)


if __name__ == '__main__':
    s = [1,7,3,5,4]
    merge_sort(s)
    print(s)

# ==================================================================================== #