插入排序 (python实现)

插入排序我理解的是反过来的冒泡排序,冒泡排序是用当前下标的数字和下一位进行比较, 而插入排序则是跟前一位比较得到最后的列表

def insert_sort(alist):
    """
    插入排序
    :param alist:
    :return:
    """
    n = len(alist)
    for j in range(1, n):
        for i in range(j, 0, -1):
            if alist[i] < alist[i-1]:
                # 交换
                alist[i], alist[i-1] = alist[i-1], alist[i]
            else:
                break


if __name__ == '__main__':
    li = [6, 7, 5, 3, 4, 1, 8]
    insert_sort(li)
    print(li)

初始列表

li = [6, 7, 5, 3, 4, 1, 8]

得到的列表顺序依次为

[6, 5, 7, 3, 4, 1, 8]
[5, 6, 7, 3, 4, 1, 8]
[5, 6, 3, 7, 4, 1, 8]
[5, 3, 6, 7, 4, 1, 8]
[3, 5, 6, 7, 4, 1, 8]
[3, 5, 6, 4, 7, 1, 8]
[3, 5, 4, 6, 7, 1, 8]
[3, 4, 5, 6, 7, 1, 8]
[3, 4, 5, 6, 1, 7, 8]
[3, 4, 5, 1, 6, 7, 8]
[3, 4, 1, 5, 6, 7, 8]
[3, 1, 4, 5, 6, 7, 8]
[1, 3, 4, 5, 6, 7, 8]
[1, 3, 4, 5, 6, 7, 8]