基本原理
code
def insertion_sort(arr):
for loop_index in range(1, len(arr)):
insertion_index = loop_index
# 当前一个数大于后一个数时, 就交换位置
while insertion_index > 0 and arr[intertion_index - 1] > arr[instertion_index]:
# 交换位置
arr[insertion_index - 1], arr[insertion_index] = arr[insertion_index], arr[insertion_index - 1]
# 继续往前循环
insertion_index -= 1
return arr