InsertionSort Algorithm

def InsertionSort(Array):
    for arrayPosition in range (1, len(Array)):
        actualElement = Array[arrayPosition] # Elemento que se compara.

        while arrayPosition > 0 and Array[arrayPosition - 1] > actualElement:
            Array[arrayPosition] = Array[arrayPosition - 1]
            arrayPosition -= 1
            Array[arrayPosition] = actualElement

    return Array