hackerrank-ctci-bubble-sort.py

def countSwaps(a):
    swaps = 0
    n = len(a)
    for i in range(n):
        for j in range(n-1):
        # Swap adjacent elements if they are in decreasing order
            if a[j] > a[j + 1]:
                a[j], a[j + 1] = a[j+1], a[j]
                swaps += 1
    print("Array is sorted in", swaps, "swaps.")
    print("First Element:", a[0])
    print("Last Element:", a[-1])