Библиотченый метод Python

n = int(input())
a = list(map(int, input().split()))
for i in range(1, len(a)):
    if i - 1 >=0:
        while a[i] < a[i - 1] and i - 1 >= 0:
            a[i], a[i - 1] = a[i - 1], a[i]
            i -= 1
            print(' '.join(a))

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))

print(' '.join(map(str, a)))

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)