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
)
移动思维
转载请注明原文地址:https://ipadbbs.8miu.com/read-19572.html