def isort(datalist):
    i = 1
    while i < len(datalist):
        x = datalist.pop(i)
        index = 0
        while index < i and datalist[index] < x:
            index = index + 1
        datalist.insert(index, x)
        i = i + 1
    return datalist