def insertionsort(array):
for i in range(1, len(array)):
j = i
while array[j - 1] > array[j] and j > 0:
array[j - 1], array[j] = array[j], array[j - 1]
j -= 1