def sort(arr):
    count = len(arr)

    for i in range(1, count):
        j = i
        while j > 0 and arr[j-1] < arr[j]:
            arr[j-1], arr[j] = arr[j], arr[j-1]
            j -= 1
    return arr

l = [5, 2, 7, 8, 6, 1, 4, 9, 10, 1, 2, 3, 4]
print(sort(l))

文章名称：插入排序的python实现
网页链接：http://kswsj.cn/article/gpchoh.html