Insertion Sort in Python

gistfile1.py

def isort(A):
    if len(A) <= 1: return A
    i = 1
    while i < len(A):
        k = A[i]
        j = i - 1
        while j >= 0 and A[j] > k:
            A[j+1] = A[j]
            j -= 1
        A[j+1] = k
        i += 1
    return A