N种方法实现插入排序（Python）

def sort(a):
    for i in range(1,len(a)):
        index=i
        while index>0 and a[index]<a[index-1]:
            a[index-1],a[index]=a[index],a[index-1]
            index-=1
    return a
b=[1,2,44,55,33,6,1]
print(sort(b))

arr = [333, 35, 42, 41, 7, 5]

def insertionSort(arr):
    for i in range(1,len(arr)):
        for j in range(i,0,-1):
            if arr[j] < arr[j-1]:
                arr[j],arr[j-1] = arr[j-1],arr[j]
                # print(arr)
            else:
                break
        
    return arr

print(insertionSort(arr))

arr = [66,12,4,54,2,88]

def insertionSort(arr):
    '''
    请在下面补充代码，让输出的 arr 是排序后的列表
    '''
    n = len(arr)
    if n ==1:
        return lst
    for i in range(1,n):
        for j in range(i,0,-1):
            if arr[j]<arr[j-1]:
                arr[j],arr[j-1]=arr[j-1],arr[j]
                print(arr)
            else:
                break
    
                
    return arr
print(insertionSort(arr))

arr = [66,12,4,54,2,88]
List_2 = []
def insert_sort(List):
    for i in List :
        if List_2 :
            for j in range(len(List_2)):
                if List_2[j] > i :
                    List_2.insert(j,i)
                    print(List_2)
                    break
            else:
                List_2.append(i)
                
        else:
            List_2.append(i)
    return List_2
print(insert_sort(arr))

arr = [66,12,4,54,2,88]

def insertionSort(arr):
    '''
    请在下面补充代码，让输出的 arr 是排序后的列表
    '''
    arr2 = arr
    for i in range(1,len(arr)):
        min = arr2[i]
        max = arr[i-1]
        while min < max:
            print(arr)
            arr[i] = arr[i-1]
            i -= 1
            if i >= 0 and arr[i]>min:
                max = arr[i]
            else :
                i += 1
                arr[i] = min
                
                break
        # print(arr)
    return arr

print(insertionSort(arr))

arr = [66,12,4,54,2,88]

def insertionSort(arr):
    '''
    请在下面补充代码，让输出的 arr 是排序后的列表
    '''
    for i in range(len(arr)):
        index = i
        while arr[index-1]>arr[index] and index-1>=0:
            arr[index],arr[index-1]=arr[index-1],arr[index]
            print(arr)
            index -=1
    return arr


print(insertionSort(arr))

arr = [66,12,4,54,2,88]

def insertionSort(arr):
    '''
    请在下面补充代码，让输出的 arr 是排序后的列表
    '''
    new_arr = []     
    for i in range(len(arr)):
        if len(new_arr) == 0:
            new_arr.append(arr[i])
        else:
            index = 0
            for j in range(len(new_arr)):
                if arr[i] > new_arr[j]:
                    index = j+1
            new_arr.insert(index,arr[i])
        print(new_arr)           
    arr = new_arr         
    return arr
    
    
print(insertionSort(arr))