Сколько обменов сделает алгоритм пузырьковой сортировки

def bubble_sort(a):
    n = len(a)
    unordered = True
    while unordered:
        unordered = False
        for j in range(n - 1):
            if a[j] > a[j + 1]:
                a[j], a[j + 1] = a[j + 1], a[j]
                unordered = True
                ls.append(a)
        n -= 1
ls = []
a = input().split()
bubble_sort(a)
print(len(ls))

# step 1
def bubble_sort(a):
    for _ in range(len(a)):
        for i in range(1, len(a)):
            if a[i] < a[i-1]:
                a[i], a[i-1] = a[i-1], a[i]
 
 
a = map(int, input().split())
print(bubble_sort(a))

def bubble_sort(a):
n = len(a)
unordered = True
while unordered:
unordered = False
for j in range(n - 1):
if a[j] > a[j + 1]:
a[j], a[j + 1] = a[j + 1], a[j]
unordered = True
ls.append(a)
n -= 1
ls = []
a = input().split()
bubble_sort(a)
print(len(ls))

n = int(input())
bubble_sort(a[:n])

a = list(map(int,input().split()))

def count_of_swaps_in_bubble_sort(a):
    n = len(a)
    unordered = True
    count_of_swaps = 0
    while unordered:
        unordered = False
        for j in range(n - 1):
            if a[j] > a[j + 1]:
                a[j], a[j + 1] = a[j + 1], a[j]
                count_of_swaps += 1
                unordered = True
        n -= 1
    return count_of_swaps
n = int(input())
a = list(map(int, input().split()))
print(count_of_swaps_in_bubble_sort(a))