写个插入排序吧~

def insert_sort(arr):  # 检查边界情况没问题
	j = 1
	while j < len(arr):
		tmp = arr[j]  # 临时保存
		i = j - 1
		while i >= 0 and arr[i] > tmp:
			arr[i + 1] = arr[i]  # 移动
			i -= 1
		arr[i + 1] = tmp  # 插入
		j += 1
	return arr
			
# 测试通过
arr = [2, 1, 3, 4, 5, 10, 3, 2, 9]
for i in range(len(arr) + 1):
    sorted_arr = insert_sort(arr[:i])
    print(sorted_arr)

移动思维