【算法】直接插入排序

#直接插入排序
# @Time: 2018/6/21
# @Author: xfLi

def insert_sort(pre_list):
    n = len(pre_list) #序列长度
    for i in range(1, n):
        temp = pre_list[i]
        j = i - 1
        while j >= 0 and temp < pre_list[j]:
            pre_list[j + 1] = pre_list[j]
            j -= 1
        pre_list[j + 1] = temp
    return pre_list

if __name__ == '__main__':
    pre_list = [11, 33, 66, 22, 44, 23, 78, 9, 55]
    result = insert_sort(pre_list)
    print(result)