Python3几种排序算法

1.冒泡排序
def bubble_sort(num):
    for i in range(len(num) - 1):
        for j in range(len(num) - i - 1):
            if num[j] > num[j + 1]:
                num[j], num[j + 1] = num[j + 1], num[j]
    return num

2.选择排序
def select_sort(num):
    for i in range(len(num) - 1):
        min = i
        for j in range(i + 1, len(num)):
            if num[min] > num[j]:
                min = j
        if min != i:  # 若无序区第一个元素不是最小元素，则进行交换
            num[min], num[i] = mun[i], num[min]
    return num

3.插入排序
def insertSort(num):
    for i in range(1, len(num)):
        if num[i] < num[i - 1]:
            index = i
            tmp = list[i]
            while index > 0 and list[index - 1] > tmp:
                list[index] = list[index - 1]
                index -= 1
                if index != i:
                    list[index] = tmp
    return num