插入排序的原理（过程）

插入排序也是一个O(n²)的排序方式，其过程如图

动图演示

此图来自菜鸟

代码

python实现

def insertion_sort(arr):
    for i in range(len(arr)):
        preIndex = i - 1
        current = arr[i]
        while preIndex >= 0 and arr[preIndex] > current:
            arr[preIndex + 1] = arr[preIndex]
            preIndex -= 1
        arr[preIndex + 1] = current
    return arr


arr = []
for i in range(10):
    num = float(input("please enter a number:"))
    arr.append(num)

insertion_sort(arr)
print(arr)

输入与输出

please enter a number:12
please enter a number:56
please enter a number:32
please enter a number:14
please enter a number:51
please enter a number:57
please enter a number:36
please enter a number:94
please enter a number:11
please enter a number:30
[11.0, 12.0, 14.0, 30.0, 32.0, 36.0, 51.0, 56.0, 57.0, 94.0]