Python Insertion Sort

insertion-sort.py

##
# Insertion Sort
#
# Runtime complexity: O(n^2)
# Space complexity: O(1)
##

def insertion_sort(arr, detail = False):
    for i in range(1, len(arr)):
        j = i

        while arr[j] < arr[j - 1] and j > 0:
            arr[j], arr[j - 1] = arr[j - 1], arr[j]
            j -= 1

            if detail:
                print(arr)

    return arr


test_case = [5, 2, 1, 4, 3]

print(insertion_sort(test_case))