def iSort(x):
    currentNum = 0
    for i in range(2, len(x)):
        currentNum = x[i]
        pos = i
        for b in range(1, len(x)):
            if currentNum > x[b]:
                pos = b
            x.insert(b, currentNum)
            del x[i + 1]