insertionSort.py

def insertionSort(aList):
    # starting from 1 because n-1
    for index in range(1,len(aList):
      
      currentValue = aList[index]
      position = index
      
      while position > 0 and aList[position-1] > currentValue:
        aList[position] = aList[position-1]
        position = position-1
      
      aList[position] = currentValue