Библиотченый метод Python исправьте ошибку в кодах

def insertion(a, asdfgh):
    prosh = []
    z = 1
    for s in range(asdfgh):
        prosh.append(seq[s])
    for i in range(1, asdfgh):
        tmp = a[i]
        j = i - 1
        while j >= 0 and a[j]>tmp:
            a[j + 1] = a[j]
            j -= 1
        a[j + 1] = tmp
        if a != prosh:
            if z != 1:
                print()
            z = 0
            for asd in range(asdfgh):
                print(a[asd], end=' ')
            prosh = []
            for s in range(asdfgh):
                prosh.append(a[s])
n, seq = input(), list((input()).split())
insertion(seq, int(n))

n = input()
seq = list((input()).split())
for i in range(len(seq)):
        m = seq[i]
        j = i
        while (seq[j-1] > m) and (j > 0):
            seq[j] = seq[j-1]
            j = j - 1
        seq[j] = m
        if m != seq[i]:
            print(' '.join([str(c) for c in seq]))
if m == seq[i]:
            print(' '.join(seq))

def insertion_sort(i):
        temp = list_of_nums.copy()
        item_to_insert = list_of_nums[i]
        j = i - 1
        while j >= 0 and list_of_nums[j] > item_to_insert:
            list_of_nums[j + 1] = list_of_nums[j]
            j -= 1
        list_of_nums[j + 1] = item_to_insert
        if temp == list_of_nums:
            return False
        return True
 
n = int(input())
list_of_nums = [int(i) for i in input().split()]
 
for i in range(1, n):
    if insertion_sort(i):  
        print(*list_of_nums)

def insertion(i):
        temp = list_of_nums.copy()
        item_to_insert = list_of_nums[i]
        j = i - 1
        while j >= 0 and list_of_nums[j] > item_to_insert:
            list_of_nums[j + 1] = list_of_nums[j]
            j -= 1
        list_of_nums[j + 1] = item_to_insert
        if temp == list_of_nums:
            return False
        return True
 
n = int(input())
list_of_nums = [int(i) for i in input().split()]
 
for i in range(1, n):
    if insertion(i):  
        print(*list_of_nums)