def countSwaps(a):
    count = 0
    n = len(a)-1
    for passes in range(n):
        for i in range(n-passes):
            if a[i]>a[i+1]:
                a[i],a[i+1]=a[i+1],a[i]
                count+=1
    # print(a,passes-1)
    print(f"Array is sorted in {count} swaps.\nFirst Element: {a[0]}\nLast Element: {a[-1]}")