简单排序算法——python

# 冒泡排序
def bubble_sort(alist):
    """冒泡排序"""
    for j in range(len(alist)-1, 0, -1):
        # j表示每次需要比较的次数，是逐渐减少的
        for i in range(j):
            if alist[i] > alist[i+1]:
                alist[i], alist[i+1] = alist[i+1],alist[i]

li1 = [3,5,1,6,7,2,4]
bubble_sort(li1)
print("bubble:", li1)

# 选择排序
def selection_sort(alist):
    """选择排序"""
    n = len(alist)
    # 总共需要循环n-1次
    for i in range(n-1):
        # 记录最小位置
        min_index = i
        for j in range(i+1, n):
            if alist[j] < alist[min_index]:
                min_index = j
        # 如果选择出的数据不在正确的位置（也就是原来i的位置）则进行交换
        if min_index != i:
            alist[i], alist[min_index] = alist[min_index], alist[i]

li2 = [3,5,1,6,7,2,4]
selection_sort(li2)
print("selection_sort:", li2)

# 插入排序
def insert_sort(alist):
    """插入排序"""
    # 从第二个位置，即下标为1的元素开始向前插入
    for i in range(1, len(alist)):
        # 从第i个元素向前比较，如果小于前一个元素则交换
        for j in range(i,0,-1):
            if alist[j] < alist[j-1]:
                alist[j], alist[j-1] = alist[j-1], alist[j]

li3 = [3,5,1,6,7,2,4]
insert_sort(li3)
print("insert_sort:", li3)

# 快速排序
def quick_sort(alist, start, end):
    """快速排序"""
    # 递归退出的条件
    if start >= end:
        return
    # 设定起始元素为基准元素
    min = alist[start]
    # low为序列左边的由左向右移动的游标
    low = start
    # high为序列右边的由右向左移动的游标
    high = end
    while low < high:
        # 如果low和high未重合，且high指向的元素大于min基准元素，则high向左移动
        while low < high and alist[high] >= min:
            high -= 1

        # 将high指向的元素放到low位置上
        alist[low] = alist[high]

        # 如果low和high未重合，且low指向的元素小于min基准元素，则low向右移动
        while low < high and alist[low] < min:
            low += 1

        # 将low指向的元素放到high位置上
        alist[high] = alist[low]

    # low与high重合，退出循环，此时low所指的位置就是基准元素正确位置
    # 将基准元素放到该位置上
    alist[low] = min

    # 对基准元素右边的子序列进行快速排序
    quick_sort(alist, start, low-1)
    # 对基准元素左边的子序列进行快速排序
    quick_sort(alist, low+1, end)

li4 = [3,5,1,6,7,2,4]
quick_sort(li4, 0, len(li4)-1)
print("quick_sort:", li4)

# 归并排序
def merge_sort(alist):
    if len(alist) <= 1:
        return alist
    # 二分分解
    num = len(alist)//2
    left = merge_sort(alist[:num])
    right = merge_sort(alist[num:])
    # 合并
    return merge(left, right)

def merge(left, right):
    """合并操作，将两个有序数组left[]和right[]合并成大的有序数组"""
    # left和right的下标指针
    l, r = 0, 0
    result = []
    while l < len(left) and r < len(right):
        if left[l] <= right[r]:
            result.append(left[l])
            l += 1
        else:
            result.append(right[r])
            r += 1

    result += left[l:]
    result += right[r:]
    return result

li5 = [3,5,1,6,7,2,4]
sorted_list = merge_sort(li5)
print("merge_sort:", sorted_list)