Python实现插入排序算法

def insert_sort(alist):
    n = len(alist)
    for j in range(1,n):
        i = j
        while i > 0:
            if alist[i] < alist[i-1]:
                alist[i] , alist[i-1] = alist[i-1] , alist[i]
                i -= 1
            else:
                break

alist = [54,26,17,29,66]
print(alist)
insert_sort(alist)
print(alist)


def insert_sort1(alist):
    for i in range(1,len(alist)):
        #从当前位置倒着往前执行
        for j in range(i,0,-1):
            if alist[j] < alist[j-1]:
                alist[j] , alist[j-1] = alist[j-1] , alist[j]
alist = [54,26,17,29,66]
print(alist)
insert_sort1(alist)
print(alist)

#最坏时间复杂度O(n^2),最好时间复杂度O(n^2)有序状态，稳定