Function insert_sort

code/all_sort.py:48–59

(arr1)

# 插入
def insert_sort(arr1):
    temp = [arr1[0]]
    arr1 = arr1[1:]
    while arr1:
        for j in range(len(temp)):
            if temp[j] > arr1[0]:
                temp.insert(j, arr1[0])
                break
        else:
            temp.insert(len(temp), arr1[0])
        arr1.pop(0)
    return temp

def insertSort(relist):
    len_ = len(relist)