gatarelib

# Insertion Sort In Python
# 
# Performance Complexity = O(n^2)
# Space Complexity = O(n)

def insertionSort(my_list):
    # for every element in our array
    for index in range(1, len(my_list)):
        current = my_list[index]
        position = index