⬅ Comb Sort | A Helpful Line-by-Line Code Tutorial

# This function takes the value of the current inc
# divides it with the value of 1.3.
# 1.3 in this case is an arbitrary value that 'science' found
# to be the most ideal to be used in this case
def RecalibrateInc(inc):

    # divide the value of inc by 1.3 and then give
    # the value to inc
    inc = inc / 1.3

    # I don't know what to write as a comment here
    return 1 if inc < 1 else int(inc)

# The algorithmic function (A decendent of the BubbleSort)
def CombSort(array):
 
    # The inc starts from the highest value
    inc = len(array)

    # This boolean tracks whether a swap occured in the current iteration
    swap = True
 
    # if inc is 1 and no swaps are happening, the array has been sorted
    # if either of them are true, trudge forward because work needs to be done
    while not inc == 1 or swap == True:

        # Get a new value for the inc
        inc = RecalibrateInc(inc)

        # Set swap to False
        swap = False
 
        # Do the bubb.. bubb.. CombSort
        # len(array) - inc because len(array) - inc + inc onwards, no elements exist
        for i in range(0, len(array) - inc): 

            if array[i] > array[i + inc]:
            
                # swap the array elements
                array[i], array[i + inc] = array[i + inc], array[i]
            
                swap = True
 
# The array on which you will operate
array = [ 8, 4, 1, 3, -44 ]

# Start Combing
CombSort(array)

# Print the array
print(array)