实用：python直接插入排序（稳定性排序算法）

m_list = [[1,2,3,4,5,6,7,8,9],
       [9,8,7,6,5,4,3,2,1],
       [3,5,4,1,2,6,7,8,9],
       [1,1,1,1,1,1,1,1,1]
]
lst = [0] + m_list[2]
print(lst)
n = len(lst)
for i in range(2,n):
    lst[0] = lst[i]
    j = i-1
    if lst[j] > lst[0]:
        while lst[j] > lst[0]:
            lst[j+1] = lst[j]
            j -= 1
        lst[j+1] = lst[0]
        
print(lst[1:])

运行结果：

[0, 3, 5, 4, 1, 2, 6, 7, 8, 9]
[1, 2, 3, 4, 5, 6, 7, 8, 9]