An implementation of bubble sort in python

sort.py

def sort(arr):
    arrLen = len(arr)
    times_sorted = 0
    for _ in range(arrLen):
        for i in range(arrLen - times_sorted):
            if i < arrLen-1:
                if arr[i] > arr[i+1]:
                    a = arr[i]
                    b = arr[i+1]
                    arr[i] = b
                    arr[i+1] = a
        times_sorted += 1
    return arr