Algorithm: insertion sort

insertion_sort.py

# Complexity: O(n^2)

def sort(arr):
    l = len(arr)
    if l > 1:
        for ldx in range(l):
            idx = ldx - 1
            key = arr[ldx]
            while idx > -1 and arr[idx] > key:
                arr[idx + 1] = arr[idx]
                idx -= 1
            arr[idx + 1] = key

    return arr