insertionSort (simple)

def insertionSort (arr):
    for i in range (1, len(arr)):
        leftIndex = i - 1
        key = arr[i]
        while leftIndex >= 0 and key < arr[leftIndex]:
            arr[leftIndex + 1] = arr[leftIndex]
            leftIndex -= 1
        arr[leftIndex + 1] = key
    return arr

# Example
print(insertionSort([5, 3, 6, 2, 10]))