插入排序 思路: 从后往前遍历,把新元素插在它该放在的地方,每次插之前,数组已经有序 代码实现 li = [5, 2, 4, 6, 1, 3] n = len(li) for i in range(1, n): target = li[i] j = i - 1 while j >= 0 and li[j] > target: li[j], li[j+1] = li[j+1], li[j] j -= 1 print(li)