python 算法--插入排序

从第2个数开始递增，与前面所有数进行比较，符合条件就交换位置

def insert_sor(alist):
    for index in range(1, len(alist)):
        value = alist[index]
        i = index - 1
        while i >= 0:
            if value < alist[i]:
                alist[i+1] = alist[i]
                alist[i] = value
                i = i - 1
            else:
                break
    return alist