python 排序算法之---插入排序

def insert(arr, target):    if len(arr) < 1:        return arr    if target <= arr[0]:        arr.insert(0, target)        return arr    if target >= arr[-1]:        arr.append(target)        return arr    for i in range(len(arr)):        if target > arr[i] and target < arr[i+1]:            arr.insert(i+1, target)            break    return arrL = [1,3,5,7,9,11,13,15]print(insert(L, 12))